Base | Representation |
---|---|
bin | 1010111100111001101110… |
… | …0111000100001110111011 |
3 | 1120122010222011002021020222 |
4 | 2233032123213010032323 |
5 | 3034241243413240443 |
6 | 41335424502210255 |
7 | 2351651134363523 |
oct | 257163347041673 |
9 | 46563864067228 |
10 | 12041404040123 |
11 | 3922804730a87 |
12 | 1425855a2398b |
13 | 694665606803 |
14 | 2d8b42830683 |
15 | 15d357ce9468 |
hex | af39b9c43bb |
12041404040123 has 16 divisors (see below), whose sum is σ = 12222088320000. Its totient is φ = 11862003242880.
The previous prime is 12041404040111. The next prime is 12041404040131. The reversal of 12041404040123 is 32104040414021.
It is a cyclic number.
It is not a de Polignac number, because 12041404040123 - 214 = 12041404023739 is a prime.
It is a super-2 number, since 2×120414040401232 (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 = 12041404040092 and 12041404040101.
It is not an unprimeable number, because it can be changed into a prime (12041404040153) 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, 43305683 + ... + 43582851.
It is an arithmetic number, because the mean of its divisors is an integer number (763880520000).
Almost surely, 212041404040123 is an apocalyptic number.
12041404040123 is a deficient number, since it is larger than the sum of its proper divisors (180684279877).
12041404040123 is a wasteful number, since it uses less digits than its factorization.
12041404040123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 279482.
The product of its (nonzero) digits is 3072, while the sum is 26.
Adding to 12041404040123 its reverse (32104040414021), we get a palindrome (44145444454144).
The spelling of 12041404040123 in words is "twelve trillion, forty-one billion, four hundred four million, forty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •