Base | Representation |
---|---|
bin | 10111001100010011001100… |
… | …110111000001110110111010 |
3 | 111101011010122200220110210200 |
4 | 113030103030313001312322 |
5 | 101332133124000314002 |
6 | 1000534144505223030 |
7 | 30325165011302523 |
oct | 2714231467016672 |
9 | 441133580813720 |
10 | 102000320323002 |
11 | 2a556102752412 |
12 | b534418a91a76 |
13 | 44bb786b7254a |
14 | 1b28bb004584a |
15 | bbd3e0972b1c |
hex | 5cc4ccdc1dba |
102000320323002 has 96 divisors (see below), whose sum is σ = 221787251712000. Its totient is φ = 33879369756960.
The previous prime is 102000320322977. The next prime is 102000320323043. The reversal of 102000320323002 is 200323023000201.
It is a happy number.
102000320323002 is a `hidden beast` number, since 1 + 0 + 20 + 0 + 0 + 320 + 323 + 0 + 0 + 2 = 666.
It is a super-2 number, since 2×1020003203230022 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 18454913163 + ... + 18454918689.
It is an arithmetic number, because the mean of its divisors is an integer number (2310283872000).
Almost surely, 2102000320323002 is an apocalyptic number.
102000320323002 is an abundant number, since it is smaller than the sum of its proper divisors (119786931388998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102000320323002 is a wasteful number, since it uses less digits than its factorization.
102000320323002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9008 (or 9005 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 102000320323002 its reverse (200323023000201), we get a palindrome (302323343323203).
The spelling of 102000320323002 in words is "one hundred two trillion, three hundred twenty million, three hundred twenty-three thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •