Base | Representation |
---|---|
bin | 11101101011111001100… |
… | …00010111010010011000 |
3 | 10121111210120112001022120 |
4 | 32311330300113102120 |
5 | 113202430034132412 |
6 | 2100325350221240 |
7 | 133456362342042 |
oct | 16657460272230 |
9 | 3544716461276 |
10 | 1020000302232 |
11 | 363641640a9a |
12 | 145824054820 |
13 | 75254a4abc2 |
14 | 375227aaa92 |
15 | 1b7ec541b8c |
hex | ed7cc17498 |
1020000302232 has 128 divisors (see below), whose sum is σ = 2687332032000. Its totient is φ = 322196659200.
The previous prime is 1020000302179. The next prime is 1020000302257. The reversal of 1020000302232 is 2322030000201.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 21785007 + ... + 21831777.
It is an arithmetic number, because the mean of its divisors is an integer number (20994781500).
Almost surely, 21020000302232 is an apocalyptic number.
1020000302232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1020000302232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1343666016000).
1020000302232 is an abundant number, since it is smaller than the sum of its proper divisors (1667331729768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020000302232 is a wasteful number, since it uses less digits than its factorization.
1020000302232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47457 (or 47453 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 15.
Adding to 1020000302232 its reverse (2322030000201), we get a palindrome (3342030302433).
The spelling of 1020000302232 in words is "one trillion, twenty billion, three hundred two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •