Base | Representation |
---|---|
bin | 10110100110001010… |
… | …10111010011001001 |
3 | 1011022110020120210112 |
4 | 23103011113103021 |
5 | 144321110131241 |
6 | 5323440324105 |
7 | 606424426502 |
oct | 132305272311 |
9 | 34273216715 |
10 | 12131333321 |
11 | 5165904308 |
12 | 2426913635 |
13 | 11b4429153 |
14 | 831247ba9 |
15 | 4b00641eb |
hex | 2d31574c9 |
12131333321 has 8 divisors (see below), whose sum is σ = 12405120000. Its totient is φ = 11859819120.
The previous prime is 12131333309. The next prime is 12131333327. The reversal of 12131333321 is 12333313121.
12131333321 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12131333321 - 214 = 12131316937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12131333327) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 557321 + ... + 578678.
It is an arithmetic number, because the mean of its divisors is an integer number (1550640000).
Almost surely, 212131333321 is an apocalyptic number.
It is an amenable number.
12131333321 is a deficient number, since it is larger than the sum of its proper divisors (273786679).
12131333321 is a wasteful number, since it uses less digits than its factorization.
12131333321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1136239.
The product of its digits is 972, while the sum is 23.
Adding to 12131333321 its reverse (12333313121), we get a palindrome (24464646442).
The spelling of 12131333321 in words is "twelve billion, one hundred thirty-one million, three hundred thirty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •