Base | Representation |
---|---|
bin | 1011000001100110011000… |
… | …1000000111100001010100 |
3 | 1120220212021202200101022101 |
4 | 2300121212020013201110 |
5 | 3042102040421111200 |
6 | 41440453155011444 |
7 | 2360536133236126 |
oct | 260314610074124 |
9 | 46825252611271 |
10 | 12122111113300 |
11 | 3953a5a778661 |
12 | 143941a599b84 |
13 | 69c158086306 |
14 | 2dc9db465216 |
15 | 1604cd3d626a |
hex | b0666207854 |
12122111113300 has 36 divisors (see below), whose sum is σ = 26349793817760. Its totient is φ = 4840584039520.
The previous prime is 12122111113283. The next prime is 12122111113313. The reversal of 12122111113300 is 331111122121.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 103196080 + ... + 103313479.
It is an arithmetic number, because the mean of its divisors is an integer number (731938717160).
Almost surely, 212122111113300 is an apocalyptic number.
12122111113300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12122111113300 is an abundant number, since it is smaller than the sum of its proper divisors (14227682704460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12122111113300 is a wasteful number, since it uses less digits than its factorization.
12122111113300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206510160 (or 206510153 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 12122111113300 its reverse (331111122121), we get a palindrome (12453222235421).
The spelling of 12122111113300 in words is "twelve trillion, one hundred twenty-two billion, one hundred eleven million, one hundred thirteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •