Base | Representation |
---|---|
bin | 101111100011011010… |
… | …1010101111110010101 |
3 | 100202120221000121102120 |
4 | 1133012311111332111 |
5 | 3133120222321323 |
6 | 114525140330153 |
7 | 10243426461666 |
oct | 1370665257625 |
9 | 322527017376 |
10 | 102120120213 |
11 | 3a344166871 |
12 | 1795b9a3959 |
13 | 9825b23647 |
14 | 4d2a86736d |
15 | 29ca4285e3 |
hex | 17c6d55f95 |
102120120213 has 16 divisors (see below), whose sum is σ = 142478666496. Its totient is φ = 64990261440.
The previous prime is 102120120163. The next prime is 102120120251. The reversal of 102120120213 is 312021021201.
It is not a de Polignac number, because 102120120213 - 218 = 102119858069 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102120120192 and 102120120201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102120122213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8673373 + ... + 8685138.
It is an arithmetic number, because the mean of its divisors is an integer number (8904916656).
Almost surely, 2102120120213 is an apocalyptic number.
It is an amenable number.
102120120213 is a deficient number, since it is larger than the sum of its proper divisors (40358546283).
102120120213 is a wasteful number, since it uses less digits than its factorization.
102120120213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17358604.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 102120120213 its reverse (312021021201), we get a palindrome (414141141414).
The spelling of 102120120213 in words is "one hundred two billion, one hundred twenty million, one hundred twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •