Base | Representation |
---|---|
bin | 1001001111110000100101… |
… | …0001010010100011111011 |
3 | 1022222220002221011010121110 |
4 | 2103330021101102203323 |
5 | 2313031132314221201 |
6 | 33342204211211403 |
7 | 2066331313455162 |
oct | 223741121224373 |
9 | 38886087133543 |
10 | 10166343117051 |
11 | 326a581720980 |
12 | 118237b8a6b63 |
13 | 5898b35a7234 |
14 | 2720a724a3d9 |
15 | 1296b36e26d6 |
hex | 93f094528fb |
10166343117051 has 32 divisors (see below), whose sum is σ = 15047068032000. Its totient is φ = 6053353822880.
The previous prime is 10166343117043. The next prime is 10166343117071. The reversal of 10166343117051 is 15071134366101.
10166343117051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 10166343117051 - 23 = 10166343117043 is a prime.
It is a super-2 number, since 2×101663431170512 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10166343117071) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1679500 + ... + 4811798.
It is an arithmetic number, because the mean of its divisors is an integer number (470220876000).
Almost surely, 210166343117051 is an apocalyptic number.
10166343117051 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10166343117051 is a deficient number, since it is larger than the sum of its proper divisors (4880724914949).
10166343117051 is a wasteful number, since it uses less digits than its factorization.
10166343117051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3134039.
The product of its (nonzero) digits is 45360, while the sum is 39.
The spelling of 10166343117051 in words is "ten trillion, one hundred sixty-six billion, three hundred forty-three million, one hundred seventeen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •