Base | Representation |
---|---|
bin | 1001101001110100011110… |
… | …1001111011100100100000 |
3 | 1101120200202112102120100021 |
4 | 2122131013221323210200 |
5 | 2342400101442101111 |
6 | 34324011302203224 |
7 | 2143561313325061 |
oct | 232350751734440 |
9 | 41520675376307 |
10 | 10614066362656 |
11 | 3422444832019 |
12 | 12350b1423514 |
13 | 5bcb9608b933 |
14 | 289a1b602568 |
15 | 136169b51d71 |
hex | 9a747a7b920 |
10614066362656 has 24 divisors (see below), whose sum is σ = 20907855851904. Its totient is φ = 5304134717760.
The previous prime is 10614066362633. The next prime is 10614066362659. The reversal of 10614066362656 is 65626366041601.
10614066362656 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×106140663626562 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10614066362659) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 90517480 + ... + 90634663.
It is an arithmetic number, because the mean of its divisors is an integer number (871160660496).
Almost surely, 210614066362656 is an apocalyptic number.
10614066362656 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
10614066362656 is a deficient number, since it is larger than the sum of its proper divisors (10293789489248).
10614066362656 is a wasteful number, since it uses less digits than its factorization.
10614066362656 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 181153984 (or 181153976 counting only the distinct ones).
The product of its (nonzero) digits is 5598720, while the sum is 52.
The spelling of 10614066362656 in words is "ten trillion, six hundred fourteen billion, sixty-six million, three hundred sixty-two thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •