Base | Representation |
---|---|
bin | 1001000111011010100101… |
… | …1011110001011000011111 |
3 | 1022111012010012021221112002 |
4 | 2101312221123301120133 |
5 | 2303204101320044411 |
6 | 33152300411232515 |
7 | 2053065213420110 |
oct | 221665133613037 |
9 | 38435105257462 |
10 | 10023001331231 |
11 | 3214804a52679 |
12 | 115a636a4873b |
13 | 57921b5925a5 |
14 | 269189c86207 |
15 | 125ac441733b |
hex | 91da96f161f |
10023001331231 has 8 divisors (see below), whose sum is σ = 11698579061760. Its totient is φ = 8408353700088.
The previous prime is 10023001331209. The next prime is 10023001331263. The reversal of 10023001331231 is 13213310032001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10023001331231 - 214 = 10023001314847 is a prime.
It is a super-2 number, since 2×100230013312312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10023001333231) 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, 15232524491 + ... + 15232525148.
It is an arithmetic number, because the mean of its divisors is an integer number (1462322382720).
Almost surely, 210023001331231 is an apocalyptic number.
10023001331231 is a deficient number, since it is larger than the sum of its proper divisors (1675577730529).
10023001331231 is an equidigital number, since it uses as much as digits as its factorization.
10023001331231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30465049693.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 10023001331231 its reverse (13213310032001), we get a palindrome (23236311363232).
The spelling of 10023001331231 in words is "ten trillion, twenty-three billion, one million, three hundred thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •