Base | Representation |
---|---|
bin | 1010111011010000011001… |
… | …0110111101101110110111 |
3 | 1120112102222200212220010002 |
4 | 2232310012112331232313 |
5 | 3033310342313211411 |
6 | 41314431132021515 |
7 | 2346630364654553 |
oct | 256640626755667 |
9 | 46472880786102 |
10 | 12013130210231 |
11 | 3911815905117 |
12 | 142028500189b |
13 | 691aaaa51957 |
14 | 2d761d760863 |
15 | 15c7509e333b |
hex | aed065bdbb7 |
12013130210231 has 4 divisors (see below), whose sum is σ = 12157866718872. Its totient is φ = 11868393701592.
The previous prime is 12013130210177. The next prime is 12013130210239. The reversal of 12013130210231 is 13201203131021.
It is a happy number.
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 12013130210231 - 214 = 12013130193847 is a prime.
It is a super-2 number, since 2×120131302102312 (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 (12013130210239) 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, 72368254196 + ... + 72368254361.
It is an arithmetic number, because the mean of its divisors is an integer number (3039466679718).
Almost surely, 212013130210231 is an apocalyptic number.
12013130210231 is a deficient number, since it is larger than the sum of its proper divisors (144736508641).
12013130210231 is an equidigital number, since it uses as much as digits as its factorization.
12013130210231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144736508640.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 12013130210231 its reverse (13201203131021), we get a palindrome (25214333341252).
The spelling of 12013130210231 in words is "twelve trillion, thirteen billion, one hundred thirty million, two hundred ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •