Base | Representation |
---|---|
bin | 10001101000110001100… |
… | …111100011101111111100 |
3 | 11021212102021201110222122 |
4 | 101220301213203233330 |
5 | 124324200341343400 |
6 | 2324442521502112 |
7 | 153364550324300 |
oct | 21506147435774 |
9 | 4255367643878 |
10 | 1212013231100 |
11 | 428014965461 |
12 | 176a90941938 |
13 | 8a3a5402989 |
14 | 42939bcbd00 |
15 | 217d96c1685 |
hex | 11a319e3bfc |
1212013231100 has 54 divisors (see below), whose sum is σ = 3059467697160. Its totient is φ = 415547391840.
The previous prime is 1212013231087. The next prime is 1212013231109. The reversal of 1212013231100 is 11323102121.
It is a super-2 number, since 2×12120132311002 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1212013231109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 123669920 + ... + 123679719.
Almost surely, 21212013231100 is an apocalyptic number.
1212013231100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1212013231100 is an abundant number, since it is smaller than the sum of its proper divisors (1847454466060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1212013231100 is a wasteful number, since it uses less digits than its factorization.
1212013231100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 247349667 (or 247349653 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1212013231100 its reverse (11323102121), we get a palindrome (1223336333221).
The spelling of 1212013231100 in words is "one trillion, two hundred twelve billion, thirteen million, two hundred thirty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •