Base | Representation |
---|---|
bin | 101111100011001001… |
… | …0101000100101101101 |
3 | 100202120021220100020021 |
4 | 1133012102220211231 |
5 | 3133110410141141 |
6 | 114524213322141 |
7 | 10243256234623 |
oct | 1370622504555 |
9 | 322507810207 |
10 | 102111021421 |
11 | 3a33a011802 |
12 | 17958936351 |
13 | 9823c89046 |
14 | 4d29579513 |
15 | 29c972c6d1 |
hex | 17c64a896d |
102111021421 has 8 divisors (see below), whose sum is σ = 106572622464. Its totient is φ = 97651253040.
The previous prime is 102111021409. The next prime is 102111021443. The reversal of 102111021421 is 124120111201.
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 102111021421 - 29 = 102111020909 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102111021395 and 102111021404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102111051421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 343686 + ... + 567751.
It is an arithmetic number, because the mean of its divisors is an integer number (13321577808).
Almost surely, 2102111021421 is an apocalyptic number.
It is an amenable number.
102111021421 is a deficient number, since it is larger than the sum of its proper divisors (4461601043).
102111021421 is an equidigital number, since it uses as much as digits as its factorization.
102111021421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 916331.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 102111021421 its reverse (124120111201), we get a palindrome (226231132622).
The spelling of 102111021421 in words is "one hundred two billion, one hundred eleven million, twenty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •