Base | Representation |
---|---|
bin | 1101011101101010011… |
… | …1010101111001101100 |
3 | 211010000202122220022220 |
4 | 3113122213111321230 |
5 | 12242201024404400 |
6 | 254131435235340 |
7 | 22465566112653 |
oct | 3273247257154 |
9 | 733022586286 |
10 | 231301013100 |
11 | 8a104434673 |
12 | 389b22a8b50 |
13 | 18a720b53c1 |
14 | b2a323219a |
15 | 603b3dd7a0 |
hex | 35da9d5e6c |
231301013100 has 72 divisors (see below), whose sum is σ = 669307369920. Its totient is φ = 61673225280.
The previous prime is 231301013059. The next prime is 231301013113. The reversal of 231301013100 is 1310103132.
It is a super-2 number, since 2×2313010131002 (a number of 24 digits) contains 22 as substring.
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 231301013100.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 2918599 + ... + 2996801.
Almost surely, 2231301013100 is an apocalyptic number.
231301013100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
231301013100 is an abundant number, since it is smaller than the sum of its proper divisors (438006356820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
231301013100 is a wasteful number, since it uses less digits than its factorization.
231301013100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88079 (or 88072 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 231301013100 its reverse (1310103132), we get a palindrome (232611116232).
The spelling of 231301013100 in words is "two hundred thirty-one billion, three hundred one million, thirteen thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •