Base | Representation |
---|---|
bin | 1001101011111110011101… |
… | …0101001001001000001001 |
3 | 1101201020100211011121022220 |
4 | 2122333213111021020021 |
5 | 2344001430340143324 |
6 | 34353014453004253 |
7 | 2146342211521212 |
oct | 232774725111011 |
9 | 41636324147286 |
10 | 10651105006089 |
11 | 3437121114039 |
12 | 1240309623689 |
13 | 5c3519769bb2 |
14 | 28b732786409 |
15 | 1370d6679b79 |
hex | 9afe7549209 |
10651105006089 has 32 divisors (see below), whose sum is σ = 14577647970816. Its totient is φ = 6913364465280.
The previous prime is 10651105006039. The next prime is 10651105006099. The reversal of 10651105006089 is 98060050115601.
10651105006089 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 10651105006089 - 28 = 10651105005833 is a prime.
It is a super-2 number, since 2×106511050060892 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10651105006089.
It is not an unprimeable number, because it can be changed into a prime (10651105006039) 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, 362428054 + ... + 362457440.
It is an arithmetic number, because the mean of its divisors is an integer number (455551499088).
Almost surely, 210651105006089 is an apocalyptic number.
It is an amenable number.
10651105006089 is a deficient number, since it is larger than the sum of its proper divisors (3926542964727).
10651105006089 is a wasteful number, since it uses less digits than its factorization.
10651105006089 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35365.
The product of its (nonzero) digits is 64800, while the sum is 42.
The spelling of 10651105006089 in words is "ten trillion, six hundred fifty-one billion, one hundred five million, six thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •