Base | Representation |
---|---|
bin | 10011001101000011… |
… | …01110100101111000 |
3 | 222121112011220210210 |
4 | 21212201232211320 |
5 | 132103333132331 |
6 | 4423020111120 |
7 | 513330666162 |
oct | 114641564570 |
9 | 28545156723 |
10 | 10310052216 |
11 | 4410834912 |
12 | 1bb89954a0 |
13 | c83cc7819 |
14 | 6db3d1932 |
15 | 405205446 |
hex | 26686e978 |
10310052216 has 64 divisors (see below), whose sum is σ = 26198841600. Its totient is φ = 3380444928.
The previous prime is 10310052191. The next prime is 10310052217. The reversal of 10310052216 is 61225001301.
10310052216 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 10310052192 and 10310052201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10310052217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 656245 + ... + 671771.
It is an arithmetic number, because the mean of its divisors is an integer number (409356900).
Almost surely, 210310052216 is an apocalyptic number.
It is an amenable number.
10310052216 is an abundant number, since it is smaller than the sum of its proper divisors (15888789384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10310052216 is a wasteful number, since it uses less digits than its factorization.
10310052216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15988 (or 15984 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 21.
Adding to 10310052216 its reverse (61225001301), we get a palindrome (71535053517).
The spelling of 10310052216 in words is "ten billion, three hundred ten million, fifty-two thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •