Base | Representation |
---|---|
bin | 101110110000001110… |
… | …0011011001101000010 |
3 | 100121011012122220120020 |
4 | 1131200130123031002 |
5 | 3121110442441002 |
6 | 114042453554310 |
7 | 10153030366536 |
oct | 1354034331502 |
9 | 317135586506 |
10 | 100402312002 |
11 | 39642540063 |
12 | 17560645996 |
13 | 9610c80495 |
14 | 4c06667bc6 |
15 | 29297082bc |
hex | 176071b342 |
100402312002 has 16 divisors (see below), whose sum is σ = 200961151200. Its totient is φ = 33441349472.
The previous prime is 100402311973. The next prime is 100402312007. The reversal of 100402312002 is 200213204001.
100402312002 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (100402312007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6513627 + ... + 6529022.
It is an arithmetic number, because the mean of its divisors is an integer number (12560071950).
Almost surely, 2100402312002 is an apocalyptic number.
100402312002 is an abundant number, since it is smaller than the sum of its proper divisors (100558839198).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100402312002 is a wasteful number, since it uses less digits than its factorization.
100402312002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13043937.
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 100402312002 its reverse (200213204001), we get a palindrome (300615516003).
It can be divided in two parts, 1004023 and 12002, that added together give a triangular number (1016025 = T1425).
The spelling of 100402312002 in words is "one hundred billion, four hundred two million, three hundred twelve thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •