Base | Representation |
---|---|
bin | 10101011000111110100… |
… | …011100000000001100100 |
3 | 12012112010211102221120011 |
4 | 111120332203200001210 |
5 | 143040403121340321 |
6 | 3043135321020004 |
7 | 211125123320401 |
oct | 25307643400144 |
9 | 5175124387504 |
10 | 1469928308836 |
11 | 517436233769 |
12 | 1b8a70024604 |
13 | a87c9240000 |
14 | 512058bd2a8 |
15 | 2838230dae1 |
hex | 1563e8e0064 |
1469928308836 has 135 divisors (see below), whose sum is σ = 2974395985197. Its totient is φ = 635494728960.
The previous prime is 1469928308813. The next prime is 1469928308837. The reversal of 1469928308836 is 6388038299641.
The square root of 1469928308836 is 1212406.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 7 ways, for example, as 1341867392100 + 128060916736 = 1158390^2 + 357856^2 .
It is not an unprimeable number, because it can be changed into a prime (1469928308837) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 6966484771 + ... + 6966484981.
Almost surely, 21469928308836 is an apocalyptic number.
1469928308836 is the 1212406-th square number.
It is an amenable number.
1469928308836 is an abundant number, since it is smaller than the sum of its proper divisors (1504467676361).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1469928308836 is an frugal number, since it uses more digits than its factorization.
1469928308836 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 512 (or 243 counting only the distinct ones).
The product of its (nonzero) digits is 107495424, while the sum is 67.
The spelling of 1469928308836 in words is "one trillion, four hundred sixty-nine billion, nine hundred twenty-eight million, three hundred eight thousand, eight hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •