Base | Representation |
---|---|
bin | 11101101110010101110… |
… | …00010010011101000000 |
3 | 10121122011220211111222102 |
4 | 32313022320102131000 |
5 | 113213121104034212 |
6 | 2101103411125532 |
7 | 133534016166320 |
oct | 16671270223500 |
9 | 3548156744872 |
10 | 1021311002432 |
11 | 3641544874a6 |
12 | 145b2aba38a8 |
13 | 75403461356 |
14 | 376088b5280 |
15 | 1b8776475c2 |
hex | edcae12740 |
1021311002432 has 112 divisors (see below), whose sum is σ = 2340567685632. Its totient is φ = 433110343680.
The previous prime is 1021311002429. The next prime is 1021311002441. The reversal of 1021311002432 is 2342001131201.
It is a tau number, because it is divible by the number of its divisors (112).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31016057 + ... + 31048967.
Almost surely, 21021311002432 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1021311002432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1170283842816).
1021311002432 is an abundant number, since it is smaller than the sum of its proper divisors (1319256683200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1021311002432 is a wasteful number, since it uses less digits than its factorization.
1021311002432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33656 (or 33646 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 1021311002432 its reverse (2342001131201), we get a palindrome (3363312133633).
The spelling of 1021311002432 in words is "one trillion, twenty-one billion, three hundred eleven million, two thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •