Base | Representation |
---|---|
bin | 1010111010100011010101… |
… | …0000110001001001101101 |
3 | 1120111021202120100221222022 |
4 | 2232220311100301021231 |
5 | 3033111103221304401 |
6 | 41305110441555525 |
7 | 2346021523460111 |
oct | 256506520611155 |
9 | 46437676327868 |
10 | 12001032213101 |
11 | 39076778aa888 |
12 | 1419a694a5ba5 |
13 | 6909004c8179 |
14 | 2d6bd2b13741 |
15 | 15c29386671b |
hex | aea3543126d |
12001032213101 has 2 divisors, whose sum is σ = 12001032213102. Its totient is φ = 12001032213100.
The previous prime is 12001032213097. The next prime is 12001032213161. The reversal of 12001032213101 is 10131223010021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6144196605001 + 5856835608100 = 2478749^2 + 2420090^2 .
It is a cyclic number.
It is not a de Polignac number, because 12001032213101 - 22 = 12001032213097 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12001032213101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12001032213161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6000516106550 + 6000516106551.
It is an arithmetic number, because the mean of its divisors is an integer number (6000516106551).
Almost surely, 212001032213101 is an apocalyptic number.
It is an amenable number.
12001032213101 is a deficient number, since it is larger than the sum of its proper divisors (1).
12001032213101 is an equidigital number, since it uses as much as digits as its factorization.
12001032213101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 12001032213101 its reverse (10131223010021), we get a palindrome (22132255223122).
The spelling of 12001032213101 in words is "twelve trillion, one billion, thirty-two million, two hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •