Base | Representation |
---|---|
bin | 1010111011011000110110… |
… | …1011000011011000101111 |
3 | 1120112122211220122111121121 |
4 | 2232312031223003120233 |
5 | 3033330020000303211 |
6 | 41315444310041411 |
7 | 2350040552162101 |
oct | 256661553033057 |
9 | 46478756574547 |
10 | 12015400400431 |
11 | 391278031566a |
12 | 14207b9349267 |
13 | 69208018a56c |
14 | 2d779706d571 |
15 | 15c834e77271 |
hex | aed8dac362f |
12015400400431 has 16 divisors (see below), whose sum is σ = 12766432883040. Its totient is φ = 11286852958080.
The previous prime is 12015400400407. The next prime is 12015400400461. The reversal of 12015400400431 is 13400400451021.
It is a cyclic number.
It is not a de Polignac number, because 12015400400431 - 211 = 12015400398383 is a prime.
It is a super-2 number, since 2×120154004004312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12015400400396 and 12015400400405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12015400400401) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17923665 + ... + 18581941.
It is an arithmetic number, because the mean of its divisors is an integer number (797902055190).
Almost surely, 212015400400431 is an apocalyptic number.
12015400400431 is a deficient number, since it is larger than the sum of its proper divisors (751032482609).
12015400400431 is a wasteful number, since it uses less digits than its factorization.
12015400400431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 675354.
The product of its (nonzero) digits is 1920, while the sum is 25.
Adding to 12015400400431 its reverse (13400400451021), we get a palindrome (25415800851452).
The spelling of 12015400400431 in words is "twelve trillion, fifteen billion, four hundred million, four hundred thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.540 sec. • engine limits •