Base | Representation |
---|---|
bin | 1001001101000100101011… |
… | …1111000101010101110110 |
3 | 1022211111000012121201220202 |
4 | 2103101022333011111312 |
5 | 2311302132424002220 |
6 | 33305053421400502 |
7 | 2063106005111402 |
oct | 223211277052566 |
9 | 38744005551822 |
10 | 10120201000310 |
11 | 3251a536a46a5 |
12 | 1175442a09132 |
13 | 58543bb8a28b |
14 | 26db6b038102 |
15 | 1283b289e275 |
hex | 9344afc5576 |
10120201000310 has 16 divisors (see below), whose sum is σ = 18216399960000. Its totient is φ = 4048071920256.
The previous prime is 10120201000297. The next prime is 10120201000339. The reversal of 10120201000310 is 1300010202101.
It is a super-2 number, since 2×101202010003102 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10120201000291 and 10120201000300.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6563006 + ... + 7956974.
It is an arithmetic number, because the mean of its divisors is an integer number (1138524997500).
Almost surely, 210120201000310 is an apocalyptic number.
10120201000310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10120201000310 is a deficient number, since it is larger than the sum of its proper divisors (8096198959690).
10120201000310 is a wasteful number, since it uses less digits than its factorization.
10120201000310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2119975.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 10120201000310 its reverse (1300010202101), we get a palindrome (11420211202411).
The spelling of 10120201000310 in words is "ten trillion, one hundred twenty billion, two hundred one million, three hundred ten", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •