Base | Representation |
---|---|
bin | 10111001100011101001001… |
… | …100010110110101101001000 |
3 | 111101012011020010121000222221 |
4 | 113030131021202312231020 |
5 | 101332322013020333112 |
6 | 1000543112445223424 |
7 | 30326023505136034 |
oct | 2714351142665510 |
9 | 441164203530887 |
10 | 102011002121032 |
11 | 2a55a694304374 |
12 | b5364ba261b74 |
13 | 44bc799b981b4 |
14 | 1b295049651c4 |
15 | bbd818609e07 |
hex | 5cc7498b6b48 |
102011002121032 has 32 divisors (see below), whose sum is σ = 199603184014080. Its totient is φ = 48783851733760.
The previous prime is 102011002121029. The next prime is 102011002121099. The reversal of 102011002121032 is 230121200110201.
It is a junction number, because it is equal to n+sod(n) for n = 102011002120997 and 102011002121015.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 20593969 + ... + 25062592.
It is an arithmetic number, because the mean of its divisors is an integer number (6237599500440).
Almost surely, 2102011002121032 is an apocalyptic number.
It is an amenable number.
102011002121032 is a deficient number, since it is larger than the sum of its proper divisors (97592181893048).
102011002121032 is a wasteful number, since it uses less digits than its factorization.
102011002121032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45668733 (or 45668729 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 102011002121032 its reverse (230121200110201), we get a palindrome (332132202231233).
The spelling of 102011002121032 in words is "one hundred two trillion, eleven billion, two million, one hundred twenty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •