Base | Representation |
---|---|
bin | 10011011010001100… |
… | …10011000111100110 |
3 | 222220012122012111121 |
4 | 21231012103013212 |
5 | 132320044133220 |
6 | 4441555124154 |
7 | 516140052055 |
oct | 115506230746 |
9 | 28805565447 |
10 | 10420302310 |
11 | 4467a973a0 |
12 | 20298a365a |
13 | ca0ab9972 |
14 | 70bcd039c |
15 | 40ec31eaa |
hex | 26d1931e6 |
10420302310 has 64 divisors (see below), whose sum is σ = 20730613824. Its totient is φ = 3739648000.
The previous prime is 10420302307. The next prime is 10420302323. The reversal of 10420302310 is 1320302401.
It is a happy number.
10420302310 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×104203023102 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 3920502 + ... + 3923158.
It is an arithmetic number, because the mean of its divisors is an integer number (323915841).
Almost surely, 210420302310 is an apocalyptic number.
10420302310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10420302310 is a deficient number, since it is larger than the sum of its proper divisors (10310311514).
10420302310 is a wasteful number, since it uses less digits than its factorization.
10420302310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3129.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 10420302310 its reverse (1320302401), we get a palindrome (11740604711).
Subtracting from 10420302310 its reverse (1320302401), we obtain a palindrome (9099999909).
The spelling of 10420302310 in words is "ten billion, four hundred twenty million, three hundred two thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •