Base | Representation |
---|---|
bin | 1001001110111000000001… |
… | …1100011101010101000101 |
3 | 1022221102220222110020020020 |
4 | 2103232000130131111011 |
5 | 2312304040120224021 |
6 | 33331214005325353 |
7 | 2065253162653263 |
oct | 223560034352505 |
9 | 38842828406206 |
10 | 10151162664261 |
11 | 32640a1758023 |
12 | 117b443a06859 |
13 | 5883345591a8 |
14 | 271467091433 |
15 | 1290c5b357c6 |
hex | 93b8071d545 |
10151162664261 has 8 divisors (see below), whose sum is σ = 13764288358560. Its totient is φ = 6652739373072.
The previous prime is 10151162664229. The next prime is 10151162664263. The reversal of 10151162664261 is 16246626115101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10151162664261 - 25 = 10151162664229 is a prime.
It is a super-2 number, since 2×101511626642612 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10151162664263) 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, 28675600570 + ... + 28675600923.
It is an arithmetic number, because the mean of its divisors is an integer number (1720536044820).
Almost surely, 210151162664261 is an apocalyptic number.
It is an amenable number.
10151162664261 is a deficient number, since it is larger than the sum of its proper divisors (3613125694299).
10151162664261 is an equidigital number, since it uses as much as digits as its factorization.
10151162664261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57351201555.
The product of its (nonzero) digits is 103680, while the sum is 42.
Adding to 10151162664261 its reverse (16246626115101), we get a palindrome (26397788779362).
The spelling of 10151162664261 in words is "ten trillion, one hundred fifty-one billion, one hundred sixty-two million, six hundred sixty-four thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •