Base | Representation |
---|---|
bin | 11101110001110111001… |
… | …01111100101100000000 |
3 | 10121211001201010011112200 |
4 | 32320323211330230000 |
5 | 113231004204120341 |
6 | 2102015202153200 |
7 | 133631620445334 |
oct | 16707345745400 |
9 | 3554051104480 |
10 | 1023202020096 |
11 | 364a34958013 |
12 | 146378352800 |
13 | 7564516b609 |
14 | 37747ac17c4 |
15 | 1b93867ddb6 |
hex | ee3b97cb00 |
1023202020096 has 216 divisors, whose sum is σ = 3082976123136. Its totient is φ = 325754542080.
The previous prime is 1023202020077. The next prime is 1023202020143. The reversal of 1023202020096 is 6900202023201.
It is a super-3 number, since 3×10232020200963 (a number of 37 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 36603501 + ... + 36631443.
Almost surely, 21023202020096 is an apocalyptic number.
1023202020096 is a gapful number since it is divisible by the number (16) 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 1023202020096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1541488061568).
1023202020096 is an abundant number, since it is smaller than the sum of its proper divisors (2059774103040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1023202020096 is a wasteful number, since it uses less digits than its factorization.
1023202020096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28679 (or 28662 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 1023202020096 its reverse (6900202023201), we get a palindrome (7923404043297).
The spelling of 1023202020096 in words is "one trillion, twenty-three billion, two hundred two million, twenty thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •