Base | Representation |
---|---|
bin | 1001010111100010111010… |
… | …1101101101101000110000 |
3 | 1100110200101202010200201220 |
4 | 2111320232231231220300 |
5 | 2322224114004424102 |
6 | 33523450241425040 |
7 | 2112105313402032 |
oct | 225705655555060 |
9 | 40420352120656 |
10 | 10300115311152 |
11 | 331128862a297 |
12 | 11a429393b180 |
13 | 5993b1b2ba84 |
14 | 2787576c9c52 |
15 | 12cde27cd1bc |
hex | 95e2eb6da30 |
10300115311152 has 40 divisors (see below), whose sum is σ = 27327783420336. Its totient is φ = 3340577938176.
The previous prime is 10300115311111. The next prime is 10300115311159. The reversal of 10300115311152 is 25111351100301.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (10300115311159) 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 7 ways as a sum of consecutive naturals, for example, 2899805463 + ... + 2899809014.
Almost surely, 210300115311152 is an apocalyptic number.
10300115311152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10300115311152 is an abundant number, since it is smaller than the sum of its proper divisors (17027668109184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10300115311152 is a wasteful number, since it uses less digits than its factorization.
10300115311152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5799614525 (or 5799614519 counting only the distinct ones).
The product of its (nonzero) digits is 450, while the sum is 24.
Adding to 10300115311152 its reverse (25111351100301), we get a palindrome (35411466411453).
The spelling of 10300115311152 in words is "ten trillion, three hundred billion, one hundred fifteen million, three hundred eleven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •