Base | Representation |
---|---|
bin | 101111100010110110… |
… | …1001010110101010010 |
3 | 100202112121102101001201 |
4 | 1133011231022311102 |
5 | 3133100401401320 |
6 | 114523223021414 |
7 | 10243106611432 |
oct | 1370555126522 |
9 | 322477371051 |
10 | 102101200210 |
11 | 3a3345139a9 |
12 | 1795559a86a |
13 | 9821c2a989 |
14 | 4d281402c2 |
15 | 29c893c70a |
hex | 17c5b4ad52 |
102101200210 has 8 divisors (see below), whose sum is σ = 183782160396. Its totient is φ = 40840480080.
The previous prime is 102101200207. The next prime is 102101200291. The reversal of 102101200210 is 12002101201.
It can be written as a sum of positive squares in 2 ways, for example, as 99756800649 + 2344399561 = 315843^2 + 48419^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 10210120021 = 102101200210 / (1 + 0 + 2 + 1 + 0 + 1 + 2 + 0 + 0 + 2 + 1 + 0).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5105060001 + ... + 5105060020.
Almost surely, 2102101200210 is an apocalyptic number.
102101200210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102101200210 is a deficient number, since it is larger than the sum of its proper divisors (81680960186).
102101200210 is a wasteful number, since it uses less digits than its factorization.
102101200210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10210120028.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 102101200210 its reverse (12002101201), we get a palindrome (114103301411).
Subtracting from 102101200210 its reverse (12002101201), we obtain a palindrome (90099099009).
The spelling of 102101200210 in words is "one hundred two billion, one hundred one million, two hundred thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •