Base | Representation |
---|---|
bin | 11100110000010011110000… |
… | …000011001101010010011001 |
3 | 121120202221101101110200001011 |
4 | 130300103300003031102121 |
5 | 113034000402333423441 |
6 | 1124545123412053521 |
7 | 35431540460164036 |
oct | 3460236003152231 |
9 | 546687341420034 |
10 | 126465044436121 |
11 | 37328584713596 |
12 | 122259336042a1 |
13 | 55747aa971611 |
14 | 2332d2582238d |
15 | e949a551c581 |
hex | 7304f00cd499 |
126465044436121 has 4 divisors (see below), whose sum is σ = 127625274201700. Its totient is φ = 125304814670544.
The previous prime is 126465044436109. The next prime is 126465044436127. The reversal of 126465044436121 is 121634440564621.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 87864470696025 + 38600573740096 = 9373605^2 + 6212936^2 .
It is a cyclic number.
It is not a de Polignac number, because 126465044436121 - 27 = 126465044435993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (126465044436127) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 580114882626 + ... + 580114882843.
It is an arithmetic number, because the mean of its divisors is an integer number (31906318550425).
Almost surely, 2126465044436121 is an apocalyptic number.
It is an amenable number.
126465044436121 is a deficient number, since it is larger than the sum of its proper divisors (1160229765579).
126465044436121 is a wasteful number, since it uses less digits than its factorization.
126465044436121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1160229765578.
The product of its (nonzero) digits is 3317760, while the sum is 49.
The spelling of 126465044436121 in words is "one hundred twenty-six trillion, four hundred sixty-five billion, forty-four million, four hundred thirty-six thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •