Base | Representation |
---|---|
bin | 1001101011111110011100… |
… | …1110010101111000010001 |
3 | 1101201020100200211000211011 |
4 | 2122333213032111320101 |
5 | 2344001424411121223 |
6 | 34353014350450521 |
7 | 2146342160414500 |
oct | 232774716257021 |
9 | 41636320730734 |
10 | 10651103223313 |
11 | 3437120106673 |
12 | 1240308b03a41 |
13 | 5c35192945b7 |
14 | 28b732440837 |
15 | 1370d642680d |
hex | 9afe7395e11 |
10651103223313 has 24 divisors (see below), whose sum is σ = 12427823908800. Its totient is φ = 9101703508128.
The previous prime is 10651103223263. The next prime is 10651103223329. The reversal of 10651103223313 is 31332230115601.
It is a happy number.
It is not a de Polignac number, because 10651103223313 - 225 = 10651069668881 is a prime.
It is a super-2 number, since 2×106511032233132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10651103223113) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 68826658 + ... + 68981236.
It is an arithmetic number, because the mean of its divisors is an integer number (517825996200).
Almost surely, 210651103223313 is an apocalyptic number.
It is an amenable number.
10651103223313 is a deficient number, since it is larger than the sum of its proper divisors (1776720685487).
10651103223313 is a wasteful number, since it uses less digits than its factorization.
10651103223313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158869 (or 158862 counting only the distinct ones).
The product of its (nonzero) digits is 9720, while the sum is 31.
Adding to 10651103223313 its reverse (31332230115601), we get a palindrome (41983333338914).
The spelling of 10651103223313 in words is "ten trillion, six hundred fifty-one billion, one hundred three million, two hundred twenty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •