Base | Representation |
---|---|
bin | 101111001010111110… |
… | …0111000000000010111 |
3 | 100200110202211202010102 |
4 | 1132111330320000113 |
5 | 3124430300323111 |
6 | 114311522444315 |
7 | 10214210613062 |
oct | 1362574700027 |
9 | 320422752112 |
10 | 101300011031 |
11 | 39a6324068a |
12 | 1777120369b |
13 | 9724c4c73b |
14 | 4c8d9858d9 |
15 | 297d42d13b |
hex | 1795f38017 |
101300011031 has 8 divisors (see below), whose sum is σ = 101542870128. Its totient is φ = 101057400000.
The previous prime is 101300010949. The next prime is 101300011079. The reversal of 101300011031 is 130110003101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101300011031 is a prime.
It is a super-2 number, since 2×1013000110312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101300011091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 768956 + ... + 891006.
It is an arithmetic number, because the mean of its divisors is an integer number (12692858766).
Almost surely, 2101300011031 is an apocalyptic number.
101300011031 is a deficient number, since it is larger than the sum of its proper divisors (242859097).
101300011031 is a wasteful number, since it uses less digits than its factorization.
101300011031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124033.
The product of its (nonzero) digits is 9, while the sum is 11.
Adding to 101300011031 its reverse (130110003101), we get a palindrome (231410014132).
The spelling of 101300011031 in words is "one hundred one billion, three hundred million, eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •