Base | Representation |
---|---|
bin | 10110100100111101… |
… | …10100111111000100 |
3 | 1011021202020100102121 |
4 | 23102132310333010 |
5 | 144311013400200 |
6 | 5322440015324 |
7 | 606242523523 |
oct | 132236647704 |
9 | 34252210377 |
10 | 12121231300 |
11 | 5160134532 |
12 | 2423461544 |
13 | 11b2300019 |
14 | 82db784ba |
15 | 4ae21ae1a |
hex | 2d27b4fc4 |
12121231300 has 72 divisors (see below), whose sum is σ = 27317133536. Its totient is φ = 4664943360.
The previous prime is 12121231277. The next prime is 12121231301. The reversal of 12121231300 is 313212121.
It is not an unprimeable number, because it can be changed into a prime (12121231301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 267064 + ... + 309136.
Almost surely, 212121231300 is an apocalyptic number.
12121231300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12121231300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13658566768).
12121231300 is an abundant number, since it is smaller than the sum of its proper divisors (15195902236).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12121231300 is a wasteful number, since it uses less digits than its factorization.
12121231300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42197 (or 42190 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 12121231300 its reverse (313212121), we get a palindrome (12434443421).
The spelling of 12121231300 in words is "twelve billion, one hundred twenty-one million, two hundred thirty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •