Base | Representation |
---|---|
bin | 1011001100000001001010… |
… | …1100111010111001011100 |
3 | 1121112222021211001001200220 |
4 | 2303000102230322321130 |
5 | 3103020123111214322 |
6 | 42055014122121340 |
7 | 2406503504442126 |
oct | 263002254727134 |
9 | 47488254031626 |
10 | 12301100101212 |
11 | 3a1295a35545a |
12 | 1468051650250 |
13 | 6b2cb1406250 |
14 | 30753ac88216 |
15 | 164ea6e8555c |
hex | b3012b3ae5c |
12301100101212 has 24 divisors (see below), whose sum is σ = 30910456664976. Its totient is φ = 3784953877248.
The previous prime is 12301100101207. The next prime is 12301100101247. The reversal of 12301100101212 is 21210100110321.
It is a junction number, because it is equal to n+sod(n) for n = 12301100101191 and 12301100101200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39426602733 + ... + 39426603044.
It is an arithmetic number, because the mean of its divisors is an integer number (1287935694374).
Almost surely, 212301100101212 is an apocalyptic number.
12301100101212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12301100101212 is an abundant number, since it is smaller than the sum of its proper divisors (18609356563764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12301100101212 is a wasteful number, since it uses less digits than its factorization.
12301100101212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78853205797 (or 78853205795 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 12301100101212 its reverse (21210100110321), we get a palindrome (33511200211533).
The spelling of 12301100101212 in words is "twelve trillion, three hundred one billion, one hundred million, one hundred one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •