Base | Representation |
---|---|
bin | 1011000010001100101110… |
… | …0100101011000011101101 |
3 | 1120221211212000202001000121 |
4 | 2300203023210223003231 |
5 | 3042234130134013201 |
6 | 41445314330324541 |
7 | 2361352154142646 |
oct | 260431344530355 |
9 | 46854760661017 |
10 | 12132403032301 |
11 | 3958361247742 |
12 | 143b411289751 |
13 | 6a01083a2306 |
14 | 2dd2d62966cd |
15 | 1608d1c089a1 |
hex | b08cb92b0ed |
12132403032301 has 4 divisors (see below), whose sum is σ = 12132528870112. Its totient is φ = 12132277194492.
The previous prime is 12132403032283. The next prime is 12132403032331. The reversal of 12132403032301 is 10323030423121.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12132403032301 - 213 = 12132403024109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12132403032331) 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, 62774175 + ... + 62967148.
It is an arithmetic number, because the mean of its divisors is an integer number (3033132217528).
Almost surely, 212132403032301 is an apocalyptic number.
It is an amenable number.
12132403032301 is a deficient number, since it is larger than the sum of its proper divisors (125837811).
12132403032301 is an equidigital number, since it uses as much as digits as its factorization.
12132403032301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125837810.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 12132403032301 its reverse (10323030423121), we get a palindrome (22455433455422).
The spelling of 12132403032301 in words is "twelve trillion, one hundred thirty-two billion, four hundred three million, thirty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.038 sec. • engine limits •