Base | Representation |
---|---|
bin | 1011110110000010110111… |
… | …1110100010011100110111 |
3 | 1201002222221002012110100211 |
4 | 2331200231332202130313 |
5 | 3201332313211211411 |
6 | 43410422443250251 |
7 | 2512613601216454 |
oct | 275405576423467 |
9 | 51088832173324 |
10 | 13023112210231 |
11 | 4171086370392 |
12 | 1563b71b19987 |
13 | 7360c7074966 |
14 | 3304717a282b |
15 | 178b6375e221 |
hex | bd82dfa2737 |
13023112210231 has 4 divisors (see below), whose sum is σ = 13058026720552. Its totient is φ = 12988197699912.
The previous prime is 13023112210177. The next prime is 13023112210259. The reversal of 13023112210231 is 13201221132031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13023112210231 - 29 = 13023112209719 is a prime.
It is a super-2 number, since 2×130231122102312 (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 (13023112510231) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17457254601 + ... + 17457255346.
It is an arithmetic number, because the mean of its divisors is an integer number (3264506680138).
Almost surely, 213023112210231 is an apocalyptic number.
13023112210231 is a deficient number, since it is larger than the sum of its proper divisors (34914510321).
13023112210231 is an equidigital number, since it uses as much as digits as its factorization.
13023112210231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34914510320.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 13023112210231 its reverse (13201221132031), we get a palindrome (26224333342262).
The spelling of 13023112210231 in words is "thirteen trillion, twenty-three billion, one hundred twelve million, two hundred ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •