Base | Representation |
---|---|
bin | 1001001001000111001111… |
… | …0111010111111110100001 |
3 | 1022120222101211100011020200 |
4 | 2102101303313113332201 |
5 | 2304143314321243414 |
6 | 33213522452455413 |
7 | 2055150035561052 |
oct | 222216367277641 |
9 | 38528354304220 |
10 | 10052167368609 |
11 | 32261114691a3 |
12 | 116421661a569 |
13 | 57bbb8c42c82 |
14 | 26a755644729 |
15 | 12672ec0b109 |
hex | 92473dd7fa1 |
10052167368609 has 6 divisors (see below), whose sum is σ = 14519797310226. Its totient is φ = 6701444912400.
The previous prime is 10052167368553. The next prime is 10052167368641. The reversal of 10052167368609 is 90686376125001.
10052167368609 is a `hidden beast` number, since 1 + 0 + 0 + 5 + 21 + 6 + 7 + 3 + 6 + 8 + 609 = 666.
It can be written as a sum of positive squares in only one way, i.e., 10030047350625 + 22120017984 = 3167025^2 + 148728^2 .
It is a de Polignac number, because none of the positive numbers 2k-10052167368609 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10052167368109) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 558453742692 + ... + 558453742709.
It is an arithmetic number, because the mean of its divisors is an integer number (2419966218371).
Almost surely, 210052167368609 is an apocalyptic number.
It is an amenable number.
10052167368609 is a deficient number, since it is larger than the sum of its proper divisors (4467629941617).
10052167368609 is a wasteful number, since it uses less digits than its factorization.
10052167368609 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1116907485407 (or 1116907485404 counting only the distinct ones).
The product of its (nonzero) digits is 3265920, while the sum is 54.
The spelling of 10052167368609 in words is "ten trillion, fifty-two billion, one hundred sixty-seven million, three hundred sixty-eight thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •