Base | Representation |
---|---|
bin | 10001111010011101111… |
… | …010111110100101111100 |
3 | 11100200110012201221121220 |
4 | 101322131322332211330 |
5 | 130132102043132200 |
6 | 2341303535153340 |
7 | 154636402314126 |
oct | 21723572764574 |
9 | 4320405657556 |
10 | 1231010130300 |
11 | 435083142a55 |
12 | 17a6b2975850 |
13 | 8c112025c32 |
14 | 4381cb9a216 |
15 | 2204c3474a0 |
hex | 11e9debe97c |
1231010130300 has 72 divisors (see below), whose sum is σ = 3637504018176. Its totient is φ = 321284909760.
The previous prime is 1231010130277. The next prime is 1231010130313. The reversal of 1231010130300 is 30310101321.
It is a super-3 number, since 3×12310101303003 (a number of 37 digits) contains 333 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 1231010130300.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 43638742 + ... + 43666941.
Almost surely, 21231010130300 is an apocalyptic number.
1231010130300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1231010130300 is an abundant number, since it is smaller than the sum of its proper divisors (2406493887876).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1231010130300 is a wasteful number, since it uses less digits than its factorization.
1231010130300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 87305747 (or 87305740 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 1231010130300 its reverse (30310101321), we get a palindrome (1261320231621).
The spelling of 1231010130300 in words is "one trillion, two hundred thirty-one billion, ten million, one hundred thirty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •