Base | Representation |
---|---|
bin | 111011000111000011… |
… | …1100110101111100001 |
3 | 110010122120000100121212 |
4 | 1312032013212233201 |
5 | 4034432213104303 |
6 | 134151550355505 |
7 | 12112436452565 |
oct | 1661607465741 |
9 | 403576010555 |
10 | 126938409953 |
11 | 4991a472223 |
12 | 207274bbb95 |
13 | bc7c8076a4 |
14 | 6202a2d6a5 |
15 | 347e1a5ad8 |
hex | 1d8e1e6be1 |
126938409953 has 4 divisors (see below), whose sum is σ = 127937925120. Its totient is φ = 125938894788.
The previous prime is 126938409919. The next prime is 126938409971. The reversal of 126938409953 is 359904839621.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 126938409953 - 26 = 126938409889 is a prime.
It is a super-2 number, since 2×1269384099532 (a number of 23 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 = 126938409892 and 126938409901.
It is not an unprimeable number, because it can be changed into a prime (126938409973) 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, 499757393 + ... + 499757646.
It is an arithmetic number, because the mean of its divisors is an integer number (31984481280).
Almost surely, 2126938409953 is an apocalyptic number.
It is an amenable number.
126938409953 is a deficient number, since it is larger than the sum of its proper divisors (999515167).
126938409953 is an equidigital number, since it uses as much as digits as its factorization.
126938409953 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 999515166.
The product of its (nonzero) digits is 12597120, while the sum is 59.
The spelling of 126938409953 in words is "one hundred twenty-six billion, nine hundred thirty-eight million, four hundred nine thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •