Base | Representation |
---|---|
bin | 10110100110001010… |
… | …00100010001101000 |
3 | 1011022110002121220120 |
4 | 23103011010101220 |
5 | 144321100133100 |
6 | 5323434523240 |
7 | 606423653355 |
oct | 132305042150 |
9 | 34273077816 |
10 | 12131255400 |
11 | 5165860810 |
12 | 2426896520 |
13 | 11b43cc844 |
14 | 83122762c |
15 | 4b004b0a0 |
hex | 2d3144468 |
12131255400 has 96 divisors (see below), whose sum is σ = 41025722400. Its totient is φ = 2940908800.
The previous prime is 12131255387. The next prime is 12131255407. The reversal of 12131255400 is 455213121.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (12131255407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 912435 + ... + 925634.
It is an arithmetic number, because the mean of its divisors is an integer number (427351275).
Almost surely, 212131255400 is an apocalyptic number.
12131255400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12131255400 is an abundant number, since it is smaller than the sum of its proper divisors (28894467000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12131255400 is a wasteful number, since it uses less digits than its factorization.
12131255400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1838099 (or 1838090 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 24.
Adding to 12131255400 its reverse (455213121), we get a palindrome (12586468521).
The spelling of 12131255400 in words is "twelve billion, one hundred thirty-one million, two hundred fifty-five thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •