Base | Representation |
---|---|
bin | 10011001100000000… |
… | …00000010111000000 |
3 | 222120220112210102221 |
4 | 21212000000113000 |
5 | 132044102241341 |
6 | 4422102420424 |
7 | 513162600220 |
oct | 114600002700 |
9 | 28526483387 |
10 | 10301212096 |
11 | 440684712a |
12 | 1bb5a31714 |
13 | c82220b96 |
14 | 6da170080 |
15 | 40455aed1 |
hex | 2660005c0 |
10301212096 has 56 divisors (see below), whose sum is σ = 23905016960. Its totient is φ = 4312127232.
The previous prime is 10301212091. The next prime is 10301212127. The reversal of 10301212096 is 69021210301.
It is a tau number, because it is divible by the number of its divisors (56).
It is a super-2 number, since 2×103012120962 (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 10301212096.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10301212091) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 248106 + ... + 286633.
Almost surely, 210301212096 is an apocalyptic number.
10301212096 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
10301212096 is an abundant number, since it is smaller than the sum of its proper divisors (13603804864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10301212096 is an equidigital number, since it uses as much as digits as its factorization.
10301212096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 534801 (or 534791 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 25.
Adding to 10301212096 its reverse (69021210301), we get a palindrome (79322422397).
The spelling of 10301212096 in words is "ten billion, three hundred one million, two hundred twelve thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •