Base | Representation |
---|---|
bin | 1001001001010010001111… |
… | …1011001110001010101001 |
3 | 1022121021000200102122220201 |
4 | 2102110203323032022221 |
5 | 2304220342004321032 |
6 | 33215131530552201 |
7 | 2055313163466163 |
oct | 222244373161251 |
9 | 38537020378821 |
10 | 10055121167017 |
11 | 3227397842703 |
12 | 11648bb898661 |
13 | 57c269b9bc94 |
14 | 26a955a61933 |
15 | 1268541c58e7 |
hex | 92523ece2a9 |
10055121167017 has 8 divisors (see below), whose sum is σ = 10329216180416. Its totient is φ = 9781149047472.
The previous prime is 10055121167009. The next prime is 10055121167057. The reversal of 10055121167017 is 71076112155001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10055121167017 - 23 = 10055121167009 is a prime.
It is a super-2 number, since 2×100551211670172 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10055121167057) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30557583 + ... + 30884884.
It is an arithmetic number, because the mean of its divisors is an integer number (1291152022552).
Almost surely, 210055121167017 is an apocalyptic number.
It is an amenable number.
10055121167017 is a deficient number, since it is larger than the sum of its proper divisors (274095013399).
10055121167017 is an equidigital number, since it uses as much as digits as its factorization.
10055121167017 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61446927.
The product of its (nonzero) digits is 14700, while the sum is 37.
The spelling of 10055121167017 in words is "ten trillion, fifty-five billion, one hundred twenty-one million, one hundred sixty-seven thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •