Base | Representation |
---|---|
bin | 11101101101110000101… |
… | …01111010011001001110 |
3 | 10121121101020122000100122 |
4 | 32312320111322121032 |
5 | 113212002000013402 |
6 | 2101012501224542 |
7 | 133523221550024 |
oct | 16667025723116 |
9 | 3547336560318 |
10 | 1021000001102 |
11 | 364004979604 |
12 | 145a62a02152 |
13 | 75383bb0cb3 |
14 | 375b947a714 |
15 | 1b85a1b3ca2 |
hex | edb857a64e |
1021000001102 has 8 divisors (see below), whose sum is σ = 1546663368312. Its totient is φ = 505445545000.
The previous prime is 1021000001069. The next prime is 1021000001123. The reversal of 1021000001102 is 2011000001201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×10210000011023 (a number of 37 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1021000001102.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 2527227524 + ... + 2527227927.
It is an arithmetic number, because the mean of its divisors is an integer number (193332921039).
Almost surely, 21021000001102 is an apocalyptic number.
1021000001102 is a deficient number, since it is larger than the sum of its proper divisors (525663367210).
1021000001102 is a wasteful number, since it uses less digits than its factorization.
1021000001102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5054455554.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 1021000001102 its reverse (2011000001201), we get a palindrome (3032000002303).
Subtracting 1021000001102 from its reverse (2011000001201), we obtain a palindrome (990000000099).
The spelling of 1021000001102 in words is "one trillion, twenty-one billion, one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •