Base | Representation |
---|---|
bin | 100001110000110010100… |
… | …110001001100100010100 |
3 | 22012210122221011212022100 |
4 | 201300302212021210110 |
5 | 301003112041420200 |
6 | 4533504211402100 |
7 | 326424004550403 |
oct | 41606246114424 |
9 | 8183587155270 |
10 | 2320131201300 |
11 | 814a64639630 |
12 | 3157a72b3330 |
13 | 13aa30cb70c3 |
14 | 8041b4ab63a |
15 | 40542bc1d00 |
hex | 21c32989914 |
2320131201300 has 216 divisors, whose sum is σ = 8051854460832. Its totient is φ = 554061024000.
The previous prime is 2320131201251. The next prime is 2320131201313. The reversal of 2320131201300 is 31021310232.
2320131201300 is a `hidden beast` number, since 2 + 32 + 0 + 131 + 201 + 300 = 666.
It is a super-2 number, since 2×23201312013002 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 1085631 + ... + 2412230.
Almost surely, 22320131201300 is an apocalyptic number.
2320131201300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2320131201300 is an abundant number, since it is smaller than the sum of its proper divisors (5731723259532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2320131201300 is a wasteful number, since it uses less digits than its factorization.
2320131201300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3497959 (or 3497949 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 2320131201300 its reverse (31021310232), we get a palindrome (2351152511532).
The spelling of 2320131201300 in words is "two trillion, three hundred twenty billion, one hundred thirty-one million, two hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •