Base | Representation |
---|---|
bin | 10111001100010011111011… |
… | …111011011100110001111010 |
3 | 111101011012200201211210002101 |
4 | 113030103323323130301322 |
5 | 101332141233130323002 |
6 | 1000534355115054014 |
7 | 30325223410450066 |
oct | 2714237373346172 |
9 | 441135621753071 |
10 | 102001110011002 |
11 | 2a55647848a724 |
12 | b5345b944130a |
13 | 44bb881654857 |
14 | 1b28c46c88aa6 |
15 | bbd439e5e587 |
hex | 5cc4fbedcc7a |
102001110011002 has 8 divisors (see below), whose sum is σ = 153066032573076. Its totient is φ = 50979099153312.
The previous prime is 102001110010999. The next prime is 102001110011069. The reversal of 102001110011002 is 200110011100201.
It can be written as a sum of positive squares in 2 ways, for example, as 100361145477681 + 1639964533321 = 10018041^2 + 1280611^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1020011100110022 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 102001110011002.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10727920153 + ... + 10727929660.
Almost surely, 2102001110011002 is an apocalyptic number.
102001110011002 is a deficient number, since it is larger than the sum of its proper divisors (51064922562074).
102001110011002 is a wasteful number, since it uses less digits than its factorization.
102001110011002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21455852192.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 102001110011002 its reverse (200110011100201), we get a palindrome (302111121111203).
The spelling of 102001110011002 in words is "one hundred two trillion, one billion, one hundred ten million, eleven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •