Base | Representation |
---|---|
bin | 101111100000001010… |
… | …1000101110010011101 |
3 | 100202022022200211101202 |
4 | 1133000111011302131 |
5 | 3132404304031023 |
6 | 114510241445245 |
7 | 10240633132064 |
oct | 1370025056235 |
9 | 322268624352 |
10 | 102011002013 |
11 | 3a298607738 |
12 | 1792b340825 |
13 | 980933976b |
14 | 4d1a1811db |
15 | 29c0a72128 |
hex | 17c0545c9d |
102011002013 has 8 divisors (see below), whose sum is σ = 102163053048. Its totient is φ = 101859012864.
The previous prime is 102011002007. The next prime is 102011002081. The reversal of 102011002013 is 310200110201.
It can be written as a sum of positive squares in 4 ways, for example, as 3780159289 + 98230842724 = 61483^2 + 313418^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102011002013 - 230 = 100937260189 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102011001985 and 102011002003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102011092013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4062545 + ... + 4087577.
It is an arithmetic number, because the mean of its divisors is an integer number (12770381631).
Almost surely, 2102011002013 is an apocalyptic number.
It is an amenable number.
102011002013 is a deficient number, since it is larger than the sum of its proper divisors (152051035).
102011002013 is an equidigital number, since it uses as much as digits as its factorization.
102011002013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30943.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 102011002013 its reverse (310200110201), we get a palindrome (412211112214).
The spelling of 102011002013 in words is "one hundred two billion, eleven million, two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •