Base | Representation |
---|---|
bin | 10011000101001011100… |
… | …101000011110010000100 |
3 | 11122100112002021120022110 |
4 | 103011023211003302010 |
5 | 132440401124000200 |
6 | 2442212214301020 |
7 | 163506401603643 |
oct | 23051345036204 |
9 | 4570462246273 |
10 | 1311233031300 |
11 | 4660aa953935 |
12 | 192161357770 |
13 | 968583a2a1a |
14 | 4766d39935a |
15 | 24195195b50 |
hex | 1314b943c84 |
1311233031300 has 72 divisors (see below), whose sum is σ = 3796024913856. Its totient is φ = 349460236160.
The previous prime is 1311233031271. The next prime is 1311233031313. The reversal of 1311233031300 is 31303321131.
It is a super-3 number, since 3×13112330313003 (a number of 37 digits) contains 333 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 741144 + ... + 1780943.
It is an arithmetic number, because the mean of its divisors is an integer number (52722568248).
Almost surely, 21311233031300 is an apocalyptic number.
1311233031300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1311233031300 is an abundant number, since it is smaller than the sum of its proper divisors (2484791882556).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1311233031300 is a wasteful number, since it uses less digits than its factorization.
1311233031300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2523837 (or 2523830 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 1311233031300 its reverse (31303321131), we get a palindrome (1342536352431).
The spelling of 1311233031300 in words is "one trillion, three hundred eleven billion, two hundred thirty-three million, thirty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •