Base | Representation |
---|---|
bin | 10011000011110011… |
… | …01000001011010001 |
3 | 222102010010100221112 |
4 | 21201321220023101 |
5 | 131424000300223 |
6 | 4411204303105 |
7 | 511366142156 |
oct | 114171501321 |
9 | 28363110845 |
10 | 10232431313 |
11 | 4380a39105 |
12 | 1b969a1a95 |
13 | c70bbb2b0 |
14 | 6d0d8822d |
15 | 3ed4c1778 |
hex | 261e682d1 |
10232431313 has 8 divisors (see below), whose sum is σ = 11159030400. Its totient is φ = 9325759248.
The previous prime is 10232431303. The next prime is 10232431331. The reversal of 10232431313 is 31313423201.
10232431313 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10232431313 - 26 = 10232431249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10232431303) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4980683 + ... + 4982736.
It is an arithmetic number, because the mean of its divisors is an integer number (1394878800).
Almost surely, 210232431313 is an apocalyptic number.
10232431313 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10232431313 is a deficient number, since it is larger than the sum of its proper divisors (926599087).
10232431313 is an equidigital number, since it uses as much as digits as its factorization.
10232431313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9963511.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 10232431313 its reverse (31313423201), we get a palindrome (41545854514).
The spelling of 10232431313 in words is "ten billion, two hundred thirty-two million, four hundred thirty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •