Base | Representation |
---|---|
bin | 101111001010111110… |
… | …1101101100010110000 |
3 | 100200110210020212221020 |
4 | 1132111331231202300 |
5 | 3124430324332240 |
6 | 114311531255440 |
7 | 10214212515312 |
oct | 1362575554260 |
9 | 320423225836 |
10 | 101300230320 |
11 | 39a63380413 |
12 | 177712aa580 |
13 | 9724cc84b3 |
14 | 4c8da017b2 |
15 | 297d4730d0 |
hex | 1795f6d8b0 |
101300230320 has 80 divisors (see below), whose sum is σ = 327684241152. Its totient is φ = 25838897920.
The previous prime is 101300230319. The next prime is 101300230327. The reversal of 101300230320 is 23032003101.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 101300230320.
It is not an unprimeable number, because it can be changed into a prime (101300230327) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9170226 + ... + 9181265.
Almost surely, 2101300230320 is an apocalyptic number.
101300230320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101300230320 is an abundant number, since it is smaller than the sum of its proper divisors (226384010832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101300230320 is a wasteful number, since it uses less digits than its factorization.
101300230320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18351530 (or 18351524 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 101300230320 its reverse (23032003101), we get a palindrome (124332233421).
The spelling of 101300230320 in words is "one hundred one billion, three hundred million, two hundred thirty thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •