Base | Representation |
---|---|
bin | 11100101111111100100010… |
… | …011101011011001001000001 |
3 | 121120200120001101102200221101 |
4 | 130233330202131123021001 |
5 | 113033043331303200013 |
6 | 1124525442302454401 |
7 | 35426666024113354 |
oct | 3457744235331101 |
9 | 546616041380841 |
10 | 126440120365633 |
11 | 37318a54728528 |
12 | 12220b38594401 |
13 | 55723380a1809 |
14 | 2331a3d5a229b |
15 | e93ee73478dd |
hex | 72ff2275b241 |
126440120365633 has 8 divisors (see below), whose sum is σ = 128593380775400. Its totient is φ = 124289455812480.
The previous prime is 126440120365609. The next prime is 126440120365687. The reversal of 126440120365633 is 336563021044621.
It can be written as a sum of positive squares in 4 ways, for example, as 103936601664 + 126336183763969 = 322392^2 + 11239937^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 126440120365633 - 225 = 126440086811201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (126440120360633) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 648865908 + ... + 649060741.
It is an arithmetic number, because the mean of its divisors is an integer number (16074172596925).
Almost surely, 2126440120365633 is an apocalyptic number.
It is an amenable number.
126440120365633 is a deficient number, since it is larger than the sum of its proper divisors (2153260409767).
126440120365633 is a wasteful number, since it uses less digits than its factorization.
126440120365633 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1297928307.
The product of its (nonzero) digits is 1866240, while the sum is 46.
The spelling of 126440120365633 in words is "one hundred twenty-six trillion, four hundred forty billion, one hundred twenty million, three hundred sixty-five thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •