Base | Representation |
---|---|
bin | 10110101111001100100011… |
… | …000000111110001011010010 |
3 | 111010001221021121112110210200 |
4 | 112233030203000332023102 |
5 | 101101401114104310002 |
6 | 552403301512440030 |
7 | 30030532633526034 |
oct | 2657144300761322 |
9 | 433057247473720 |
10 | 100000311010002 |
11 | 29954991620637 |
12 | b2708919a9016 |
13 | 43a4cb16ca230 |
14 | 1a9a08024dc54 |
15 | b86386c55b1c |
hex | 5af32303e2d2 |
100000311010002 has 24 divisors (see below), whose sum is σ = 233334059023884. Its totient is φ = 30769326464544.
The previous prime is 100000311010001. The next prime is 100000311010009. The reversal of 100000311010002 is 200010113000001.
It can be written as a sum of positive squares in 2 ways, for example, as 92825729121321 + 7174581888681 = 9634611^2 + 2678541^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (100000311010001) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 213675877993 + ... + 213675878460.
Almost surely, 2100000311010002 is an apocalyptic number.
100000311010002 is an abundant number, since it is smaller than the sum of its proper divisors (133333748013882).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100000311010002 is a wasteful number, since it uses less digits than its factorization.
100000311010002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 427351756474 (or 427351756471 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 100000311010002 its reverse (200010113000001), we get a palindrome (300010424010003).
The spelling of 100000311010002 in words is "one hundred trillion, three hundred eleven million, ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •