Base | Representation |
---|---|
bin | 1010111011001100111110… |
… | …1000010100000011010100 |
3 | 1120112100121201010112212022 |
4 | 2232303033220110003110 |
5 | 3033302002233324340 |
6 | 41314200051512312 |
7 | 2346565545260531 |
oct | 256631750240324 |
9 | 46470551115768 |
10 | 12012212011220 |
11 | 3911394582663 |
12 | 14200695b8698 |
13 | 691992755825 |
14 | 2d7573827d88 |
15 | 15c6ea0be3b5 |
hex | aeccfa140d4 |
12012212011220 has 12 divisors (see below), whose sum is σ = 25225645223604. Its totient is φ = 4804884804480.
The previous prime is 12012212011211. The next prime is 12012212011243. The reversal of 12012212011220 is 2211021221021.
It can be written as a sum of positive squares in 2 ways, for example, as 8113940856004 + 3898271155216 = 2848498^2 + 1974404^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 300305300261 + ... + 300305300300.
It is an arithmetic number, because the mean of its divisors is an integer number (2102137101967).
Almost surely, 212012212011220 is an apocalyptic number.
12012212011220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12012212011220 is an abundant number, since it is smaller than the sum of its proper divisors (13213433212384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12012212011220 is a wasteful number, since it uses less digits than its factorization.
12012212011220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 600610600570 (or 600610600568 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 12012212011220 its reverse (2211021221021), we get a palindrome (14223233232241).
The spelling of 12012212011220 in words is "twelve trillion, twelve billion, two hundred twelve million, eleven thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •