Base | Representation |
---|---|
bin | 11101000110110101110… |
… | …11111101101101000101 |
3 | 10112121110002001200102202 |
4 | 32203122323331231011 |
5 | 112341204011034442 |
6 | 2043235301044245 |
7 | 132153356016500 |
oct | 16433273755505 |
9 | 3477402050382 |
10 | 1000105564997 |
11 | 3561625784a0 |
12 | 1419b13b6685 |
13 | 7340410a336 |
14 | 36596486137 |
15 | 1b035b69c32 |
hex | e8daefdb45 |
1000105564997 has 48 divisors (see below), whose sum is σ = 1325915723520. Its totient is φ = 744979536000.
The previous prime is 1000105564993. The next prime is 1000105564999. The reversal of 1000105564997 is 7994655010001.
It is not a de Polignac number, because 1000105564997 - 22 = 1000105564993 is a prime.
It is a super-2 number, since 2×10001055649972 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000105564993) 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, 1261988 + ... + 1895474.
It is an arithmetic number, because the mean of its divisors is an integer number (27623244240).
Almost surely, 21000105564997 is an apocalyptic number.
It is an amenable number.
1000105564997 is a deficient number, since it is larger than the sum of its proper divisors (325810158523).
1000105564997 is a wasteful number, since it uses less digits than its factorization.
1000105564997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 633642 (or 633635 counting only the distinct ones).
The product of its (nonzero) digits is 340200, while the sum is 47.
The spelling of 1000105564997 in words is "one trillion, one hundred five million, five hundred sixty-four thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •