Base | Representation |
---|---|
bin | 10011000011110010… |
… | …01011010101110001 |
3 | 222102002220100221000 |
4 | 21201321023111301 |
5 | 131423433010301 |
6 | 4411201552213 |
7 | 511365140625 |
oct | 114171132561 |
9 | 28362810830 |
10 | 10232313201 |
11 | 43809683a0 |
12 | 1b96945669 |
13 | c70b795c6 |
14 | 6d0d57185 |
15 | 3ed49b786 |
hex | 261e4b571 |
10232313201 has 32 divisors (see below), whose sum is σ = 16584624000. Its totient is φ = 6183570240.
The previous prime is 10232313193. The next prime is 10232313211. The reversal of 10232313201 is 10231323201.
10232313201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10232313201 - 23 = 10232313193 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10232313211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 54295 + ... + 153011.
It is an arithmetic number, because the mean of its divisors is an integer number (518269500).
Almost surely, 210232313201 is an apocalyptic number.
10232313201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10232313201 is a deficient number, since it is larger than the sum of its proper divisors (6352310799).
10232313201 is a wasteful number, since it uses less digits than its factorization.
10232313201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99086 (or 99080 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 10232313201 its reverse (10231323201), we get a palindrome (20463636402).
The spelling of 10232313201 in words is "ten billion, two hundred thirty-two million, three hundred thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •