Base | Representation |
---|---|
bin | 1001010010010011101100… |
… | …1100101011100000111111 |
3 | 1100011002010112201201122120 |
4 | 2110210323030223200333 |
5 | 2314240321343123203 |
6 | 33414245201414023 |
7 | 2102441356545441 |
oct | 224447314534077 |
9 | 40132115651576 |
10 | 10210130442303 |
11 | 3287101503490 |
12 | 118a96003a313 |
13 | 590a711a6a4c |
14 | 27425c80a491 |
15 | 12a8c793eb53 |
hex | 9493b32b83f |
10210130442303 has 32 divisors (see below), whose sum is σ = 15713734421760. Its totient is φ = 5831901296640.
The previous prime is 10210130442293. The next prime is 10210130442311. The reversal of 10210130442303 is 30324403101201.
It is a happy number.
It is not a de Polignac number, because 10210130442303 - 213 = 10210130434111 is a prime.
It is a super-3 number, since 3×102101304423033 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10210130442353) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 42065776 + ... + 42307797.
It is an arithmetic number, because the mean of its divisors is an integer number (491054200680).
Almost surely, 210210130442303 is an apocalyptic number.
10210130442303 is a deficient number, since it is larger than the sum of its proper divisors (5503603979457).
10210130442303 is a wasteful number, since it uses less digits than its factorization.
10210130442303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84373799.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 10210130442303 its reverse (30324403101201), we get a palindrome (40534533543504).
The spelling of 10210130442303 in words is "ten trillion, two hundred ten billion, one hundred thirty million, four hundred forty-two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •