Base | Representation |
---|---|
bin | 1001000111011011010101… |
… | …1010000001110111001000 |
3 | 1022111012122012021012002100 |
4 | 2101312311122001313020 |
5 | 2303210004230413112 |
6 | 33152332344433400 |
7 | 2053103202656256 |
oct | 221666532016710 |
9 | 38435565235070 |
10 | 10023202201032 |
11 | 32148a837a079 |
12 | 115a692178860 |
13 | 579251092767 |
14 | 2691a88135d6 |
15 | 125ad6d942dc |
hex | 91db5681dc8 |
10023202201032 has 96 divisors (see below), whose sum is σ = 27184827739680. Its totient is φ = 3336311185920.
The previous prime is 10023202201003. The next prime is 10023202201043. The reversal of 10023202201032 is 23010220232001.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 10023202200996 and 10023202201014.
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, 622899307 + ... + 622915397.
It is an arithmetic number, because the mean of its divisors is an integer number (283175288955).
Almost surely, 210023202201032 is an apocalyptic number.
10023202201032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10023202201032 is an abundant number, since it is smaller than the sum of its proper divisors (17161625538648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10023202201032 is a wasteful number, since it uses less digits than its factorization.
10023202201032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27883 (or 27876 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 10023202201032 its reverse (23010220232001), we get a palindrome (33033422433033).
The spelling of 10023202201032 in words is "ten trillion, twenty-three billion, two hundred two million, two hundred one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.503 sec. • engine limits •