Base | Representation |
---|---|
bin | 1001010011100110000010… |
… | …1111011010010001101000 |
3 | 1100020012012001121201122021 |
4 | 2110321200233122101220 |
5 | 2320121104143441300 |
6 | 33432342434034224 |
7 | 2104153216434013 |
oct | 224714057322150 |
9 | 40205161551567 |
10 | 10232235140200 |
11 | 3295514a8a157 |
12 | 11930aaa18974 |
13 | 592b84925948 |
14 | 27535844237a |
15 | 12b26d34ed1a |
hex | 94e60bda468 |
10232235140200 has 48 divisors (see below), whose sum is σ = 24091085304000. Its totient is φ = 4041085264320.
The previous prime is 10232235140167. The next prime is 10232235140203. The reversal of 10232235140200 is 204153223201.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (10232235140203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 323789110 + ... + 323820709.
It is an arithmetic number, because the mean of its divisors is an integer number (501897610500).
Almost surely, 210232235140200 is an apocalyptic number.
10232235140200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10232235140200 is an abundant number, since it is smaller than the sum of its proper divisors (13858850163800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10232235140200 is a wasteful number, since it uses less digits than its factorization.
10232235140200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 647609914 (or 647609905 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 25.
Adding to 10232235140200 its reverse (204153223201), we get a palindrome (10436388363401).
The spelling of 10232235140200 in words is "ten trillion, two hundred thirty-two billion, two hundred thirty-five million, one hundred forty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •