Base | Representation |
---|---|
bin | 10011000011000100… |
… | …10011001101111001 |
3 | 222101200121200112010 |
4 | 21201202103031321 |
5 | 131420414104103 |
6 | 4410425240133 |
7 | 511263152544 |
oct | 114142231571 |
9 | 28350550463 |
10 | 10226316153 |
11 | 4378541759 |
12 | 1b94933049 |
13 | c6c859a61 |
14 | 6d023585b |
15 | 3ecbb4903 |
hex | 261893379 |
10226316153 has 16 divisors (see below), whose sum is σ = 14487128640. Its totient is φ = 6416502848.
The previous prime is 10226316109. The next prime is 10226316167. The reversal of 10226316153 is 35161362201.
10226316153 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10226316153 - 210 = 10226315129 is a prime.
It is a super-2 number, since 2×102263161532 (a number of 21 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 10226316153.
It is not an unprimeable number, because it can be changed into a prime (10226316253) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 332175 + ... + 361652.
It is an arithmetic number, because the mean of its divisors is an integer number (905445540).
Almost surely, 210226316153 is an apocalyptic number.
It is an amenable number.
10226316153 is a deficient number, since it is larger than the sum of its proper divisors (4260812487).
10226316153 is an frugal number, since it uses more digits than its factorization.
10226316153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 693881 (or 693847 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 30.
Adding to 10226316153 its reverse (35161362201), we get a palindrome (45387678354).
The spelling of 10226316153 in words is "ten billion, two hundred twenty-six million, three hundred sixteen thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •