Base | Representation |
---|---|
bin | 1001000111010011001101… |
… | …0110110110110100100110 |
3 | 1022111000000010200201111100 |
4 | 2101310303112312310212 |
5 | 2303141022201100202 |
6 | 33151332043420530 |
7 | 2052665140251111 |
oct | 221646326666446 |
9 | 38430003621440 |
10 | 10021020331302 |
11 | 3213988803052 |
12 | 115a183524746 |
13 | 578c9403b496 |
14 | 26903cb35578 |
15 | 125a0a55941c |
hex | 91d335b6d26 |
10021020331302 has 48 divisors (see below), whose sum is σ = 21738075690240. Its totient is φ = 3336362562816.
The previous prime is 10021020331297. The next prime is 10021020331331. The reversal of 10021020331302 is 20313302012001.
10021020331302 is a `hidden beast` number, since 1 + 0 + 0 + 2 + 10 + 20 + 331 + 302 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
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 23 ways as a sum of consecutive naturals, for example, 74146324 + ... + 74281352.
It is an arithmetic number, because the mean of its divisors is an integer number (452876576880).
Almost surely, 210021020331302 is an apocalyptic number.
10021020331302 is an abundant number, since it is smaller than the sum of its proper divisors (11717055358938).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10021020331302 is a wasteful number, since it uses less digits than its factorization.
10021020331302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139917 (or 139914 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 10021020331302 its reverse (20313302012001), we get a palindrome (30334322343303).
The spelling of 10021020331302 in words is "ten trillion, twenty-one billion, twenty million, three hundred thirty-one thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •