Base | Representation |
---|---|
bin | 1011000010001111011001… |
… | …1111010000000100000101 |
3 | 1120221220201012112202222020 |
4 | 2300203312133100010011 |
5 | 3042242113444000201 |
6 | 41445514010353353 |
7 | 2361406046060256 |
oct | 260436637200405 |
9 | 46856635482866 |
10 | 12133123031301 |
11 | 39586a0706638 |
12 | 143b59242b859 |
13 | 6a01c15c451c |
14 | 2dd363b58b2d |
15 | 16092502ba36 |
hex | b08f67d0105 |
12133123031301 has 8 divisors (see below), whose sum is σ = 16177581782400. Its totient is φ = 8088706483872.
The previous prime is 12133123031251. The next prime is 12133123031321. The reversal of 12133123031301 is 10313032133121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12133123031301 - 29 = 12133123030789 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12133123031321) 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 7 ways as a sum of consecutive naturals, for example, 9873901 + ... + 11034498.
It is an arithmetic number, because the mean of its divisors is an integer number (2022197722800).
Almost surely, 212133123031301 is an apocalyptic number.
It is an amenable number.
12133123031301 is a deficient number, since it is larger than the sum of its proper divisors (4044458751099).
12133123031301 is a wasteful number, since it uses less digits than its factorization.
12133123031301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21101835.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 12133123031301 its reverse (10313032133121), we get a palindrome (22446155164422).
The spelling of 12133123031301 in words is "twelve trillion, one hundred thirty-three billion, one hundred twenty-three million, thirty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •