Base | Representation |
---|---|
bin | 10010101110000011… |
… | …110011001111000010 |
3 | 1220212210212221002100 |
4 | 102232003303033002 |
5 | 312131111213213 |
6 | 13122302531230 |
7 | 1311046016502 |
oct | 225603631702 |
9 | 56783787070 |
10 | 20100101058 |
11 | 8584a8a474 |
12 | 3a8b596b16 |
13 | 1b8435542b |
14 | d89701a02 |
15 | 7c9940773 |
hex | 4ae0f33c2 |
20100101058 has 12 divisors (see below), whose sum is σ = 43550218998. Its totient is φ = 6700033680.
The previous prime is 20100101041. The next prime is 20100101059. The reversal of 20100101058 is 85010100102.
It can be written as a sum of positive squares in only one way, i.e., 12609717849 + 7490383209 = 112293^2 + 86547^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 1116672281 = 20100101058 / (2 + 0 + 1 + 0 + 0 + 1 + 0 + 1 + 0 + 5 + 8).
It is a self number, because there is not a number n which added to its sum of digits gives 20100101058.
It is not an unprimeable number, because it can be changed into a prime (20100101059) 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 5 ways as a sum of consecutive naturals, for example, 558336123 + ... + 558336158.
Almost surely, 220100101058 is an apocalyptic number.
20100101058 is an abundant number, since it is smaller than the sum of its proper divisors (23450117940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20100101058 is a wasteful number, since it uses less digits than its factorization.
20100101058 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1116672289 (or 1116672286 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 18.
The spelling of 20100101058 in words is "twenty billion, one hundred million, one hundred one thousand, fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •