Base | Representation |
---|---|
bin | 11110111001010001011… |
… | …00101010110001001101 |
3 | 10202111000112021010100220 |
4 | 33130220230222301031 |
5 | 114343013132022034 |
6 | 2131355320141553 |
7 | 136456641513060 |
oct | 17345054526115 |
9 | 3674015233326 |
10 | 1061539720269 |
11 | 37a218552646 |
12 | 1518976078b9 |
13 | 79144a143c2 |
14 | 395435bc8d7 |
15 | 1c92e25c749 |
hex | f728b2ac4d |
1061539720269 has 48 divisors (see below), whose sum is σ = 1724676919296. Its totient is φ = 568804550400.
The previous prime is 1061539720261. The next prime is 1061539720279. The reversal of 1061539720269 is 9620279351601.
It is not a de Polignac number, because 1061539720269 - 23 = 1061539720261 is a prime.
It is a super-2 number, since 2×10615397202692 (a number of 25 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (51) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1061539720261) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1321984 + ... + 1967414.
It is an arithmetic number, because the mean of its divisors is an integer number (35930769152).
Almost surely, 21061539720269 is an apocalyptic number.
It is an amenable number.
1061539720269 is a deficient number, since it is larger than the sum of its proper divisors (663137199027).
1061539720269 is a wasteful number, since it uses less digits than its factorization.
1061539720269 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 645746 (or 645729 counting only the distinct ones).
The product of its (nonzero) digits is 1224720, while the sum is 51.
The spelling of 1061539720269 in words is "one trillion, sixty-one billion, five hundred thirty-nine million, seven hundred twenty thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •