Base | Representation |
---|---|
bin | 1001010010111001100101… |
… | …1011100010011011010010 |
3 | 1100012001101101001100210201 |
4 | 2110232121123202123102 |
5 | 2314422134120031010 |
6 | 33423050331045414 |
7 | 2103251410634563 |
oct | 224563133423322 |
9 | 40161341040721 |
10 | 10220301330130 |
11 | 3290450727001 |
12 | 119091a2a086a |
13 | 591a023c7678 |
14 | 27494553416a |
15 | 12acc080623a |
hex | 94b996e26d2 |
10220301330130 has 128 divisors (see below), whose sum is σ = 20175912179712. Its totient is φ = 3712300720128.
The previous prime is 10220301330091. The next prime is 10220301330133. The reversal of 10220301330130 is 3103310302201.
10220301330130 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 = 10220301330098 and 10220301330107.
It is not an unprimeable number, because it can be changed into a prime (10220301330133) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1701395587 + ... + 1701401593.
It is an arithmetic number, because the mean of its divisors is an integer number (157624313904).
Almost surely, 210220301330130 is an apocalyptic number.
10220301330130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10220301330130 is a deficient number, since it is larger than the sum of its proper divisors (9955610849582).
10220301330130 is a wasteful number, since it uses less digits than its factorization.
10220301330130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9068.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 10220301330130 its reverse (3103310302201), we get a palindrome (13323611632331).
The spelling of 10220301330130 in words is "ten trillion, two hundred twenty billion, three hundred one million, three hundred thirty thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •