Base | Representation |
---|---|
bin | 1011000011001111110001… |
… | …0001110000011011011011 |
3 | 1121000120022021021001122001 |
4 | 2300303330101300123123 |
5 | 3043033004401320311 |
6 | 41501452224341431 |
7 | 2362560145105210 |
oct | 260637421603333 |
9 | 47016267231561 |
10 | 12150400026331 |
11 | 3964a57066726 |
12 | 14429b4474877 |
13 | 6a1a15abc5c8 |
14 | 30012253db07 |
15 | 1610d6bbb4c1 |
hex | b0cfc4706db |
12150400026331 has 32 divisors (see below), whose sum is σ = 14036021273088. Its totient is φ = 10302532454400.
The previous prime is 12150400026311. The next prime is 12150400026377. The reversal of 12150400026331 is 13362000405121.
It is a cyclic number.
It is not a de Polignac number, because 12150400026331 - 213 = 12150400018139 is a prime.
It is a super-2 number, since 2×121504000263312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12150400026331.
It is not an unprimeable number, because it can be changed into a prime (12150400026311) 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 31 ways as a sum of consecutive naturals, for example, 1826300601 + ... + 1826307253.
It is an arithmetic number, because the mean of its divisors is an integer number (438625664784).
Almost surely, 212150400026331 is an apocalyptic number.
12150400026331 is a deficient number, since it is larger than the sum of its proper divisors (1885621246757).
12150400026331 is a wasteful number, since it uses less digits than its factorization.
12150400026331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9891.
The product of its (nonzero) digits is 4320, while the sum is 28.
The spelling of 12150400026331 in words is "twelve trillion, one hundred fifty billion, four hundred million, twenty-six thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •