Base | Representation |
---|---|
bin | 1001011110001100011001… |
… | …1100010101011100010010 |
3 | 1100212121012120022012002022 |
4 | 2113203012130111130102 |
5 | 2331112021442322010 |
6 | 34052135511451442 |
7 | 2123260543525640 |
oct | 227430634253422 |
9 | 40777176265068 |
10 | 10414330042130 |
11 | 3355768898143 |
12 | 120244a086b82 |
13 | 5a70b4591721 |
14 | 2800b055c190 |
15 | 130d79914d55 |
hex | 978c6715712 |
10414330042130 has 64 divisors (see below), whose sum is σ = 21923478593280. Its totient is φ = 3487353053184.
The previous prime is 10414330042111. The next prime is 10414330042147. The reversal of 10414330042130 is 3124003341401.
It is a happy number.
It is a super-2 number, since 2×104143300421302 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10414330042130.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 47475662 + ... + 47694518.
It is an arithmetic number, because the mean of its divisors is an integer number (342554353020).
Almost surely, 210414330042130 is an apocalyptic number.
10414330042130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10414330042130 is an abundant number, since it is smaller than the sum of its proper divisors (11509148551150).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10414330042130 is a wasteful number, since it uses less digits than its factorization.
10414330042130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 234723.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 10414330042130 its reverse (3124003341401), we get a palindrome (13538333383531).
The spelling of 10414330042130 in words is "ten trillion, four hundred fourteen billion, three hundred thirty million, forty-two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •