Base | Representation |
---|---|
bin | 101111001010111111… |
… | …0000001100011110110 |
3 | 100200110210102001101220 |
4 | 1132111332001203312 |
5 | 3124430334443220 |
6 | 114311533131210 |
7 | 10214213306331 |
oct | 1362576014366 |
9 | 320423361356 |
10 | 101300312310 |
11 | 39a63426a7a |
12 | 17771329b06 |
13 | 9725026902 |
14 | 4c8da23618 |
15 | 297d48c540 |
hex | 1795f818f6 |
101300312310 has 32 divisors (see below), whose sum is σ = 250963356672. Its totient is φ = 26142015840.
The previous prime is 101300312287. The next prime is 101300312359. The reversal of 101300312310 is 13213003101.
It is a super-2 number, since 2×1013003123102 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 101300312310.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 54461604 + ... + 54463463.
It is an arithmetic number, because the mean of its divisors is an integer number (7842604896).
Almost surely, 2101300312310 is an apocalyptic number.
101300312310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101300312310 is an abundant number, since it is smaller than the sum of its proper divisors (149663044362).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101300312310 is a wasteful number, since it uses less digits than its factorization.
101300312310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108925108.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 101300312310 its reverse (13213003101), we get a palindrome (114513315411).
The spelling of 101300312310 in words is "one hundred one billion, three hundred million, three hundred twelve thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •