Base | Representation |
---|---|
bin | 1001010111101010011011… |
… | …0100000100000111011010 |
3 | 1100110212121011120210020201 |
4 | 2111322212310010013122 |
5 | 2322242230320221020 |
6 | 33524422220412414 |
7 | 2112206251131025 |
oct | 225724664040732 |
9 | 40425534523221 |
10 | 10302130242010 |
11 | 3312121a44702 |
12 | 11a47566a710a |
13 | 599643403159 |
14 | 2788a91501bc |
15 | 12ceae63ea0a |
hex | 95ea6d041da |
10302130242010 has 8 divisors (see below), whose sum is σ = 18543834435636. Its totient is φ = 4120852096800.
The previous prime is 10302130241993. The next prime is 10302130242013. The reversal of 10302130242010 is 1024203120301.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 8975770329681 + 1326359912329 = 2995959^2 + 1151677^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×103021302420102 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10302130242013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 515106512091 + ... + 515106512110.
Almost surely, 210302130242010 is an apocalyptic number.
10302130242010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10302130242010 is a deficient number, since it is larger than the sum of its proper divisors (8241704193626).
10302130242010 is a wasteful number, since it uses less digits than its factorization.
10302130242010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1030213024208.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 10302130242010 its reverse (1024203120301), we get a palindrome (11326333362311).
The spelling of 10302130242010 in words is "ten trillion, three hundred two billion, one hundred thirty million, two hundred forty-two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •