Base | Representation |
---|---|
bin | 1001101001111000010101… |
… | …0001001010001111100111 |
3 | 1101120210102120111122210100 |
4 | 2122132011101022033213 |
5 | 2342404211103302201 |
6 | 34324302025555143 |
7 | 2143626034510644 |
oct | 232360521121747 |
9 | 41523376448710 |
10 | 10615100056551 |
11 | 34229252795a1 |
12 | 123533b645ab3 |
13 | 5bcccc295223 |
14 | 289ab8a00dcb |
15 | 1361ca78b886 |
hex | 9a78544a3e7 |
10615100056551 has 12 divisors (see below), whose sum is σ = 15747325609912. Its totient is φ = 6885470306736.
The previous prime is 10615100056543. The next prime is 10615100056553. The reversal of 10615100056551 is 15565000151601.
It is a happy number.
10615100056551 is a `hidden beast` number, since 1 + 0 + 6 + 1 + 51 + 0 + 0 + 0 + 56 + 551 = 666.
10615100056551 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10615100056551 - 23 = 10615100056543 is a prime.
It is a super-2 number, since 2×106151000565512 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10615100056553) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 15938588341 + ... + 15938589006.
Almost surely, 210615100056551 is an apocalyptic number.
10615100056551 is a deficient number, since it is larger than the sum of its proper divisors (5132225553361).
10615100056551 is a wasteful number, since it uses less digits than its factorization.
10615100056551 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31877177390 (or 31877177387 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 36.
The spelling of 10615100056551 in words is "ten trillion, six hundred fifteen billion, one hundred million, fifty-six thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •