Base | Representation |
---|---|
bin | 10011000101011011100… |
… | …001000110101110101100 |
3 | 11122101012201102211201100 |
4 | 103011123201012232230 |
5 | 132441423102232002 |
6 | 2442254525443100 |
7 | 163516126502505 |
oct | 23053341065654 |
9 | 4571181384640 |
10 | 1311500430252 |
11 | 466227890701 |
12 | 192216a10490 |
13 | 9689b8c795c |
14 | 47696ac3bac |
15 | 241ad8b511c |
hex | 1315b846bac |
1311500430252 has 72 divisors (see below), whose sum is σ = 3505589523072. Its totient is φ = 412745990400.
The previous prime is 1311500430241. The next prime is 1311500430277. The reversal of 1311500430252 is 2520340051131.
1311500430252 is a `hidden beast` number, since 1 + 31 + 150 + 0 + 430 + 2 + 52 = 666.
It is a super-2 number, since 2×13115004302522 (a number of 25 digits) contains 22 as substring.
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, 14285703 + ... + 14377214.
It is an arithmetic number, because the mean of its divisors is an integer number (48688743376).
Almost surely, 21311500430252 is an apocalyptic number.
1311500430252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1311500430252 is an abundant number, since it is smaller than the sum of its proper divisors (2194089092820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1311500430252 is a wasteful number, since it uses less digits than its factorization.
1311500430252 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28662999 (or 28662994 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
Adding to 1311500430252 its reverse (2520340051131), we get a palindrome (3831840481383).
The spelling of 1311500430252 in words is "one trillion, three hundred eleven billion, five hundred million, four hundred thirty thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •