Base | Representation |
---|---|
bin | 1011111100010010100011… |
… | …1010001000100101110100 |
3 | 1201111020212020122120102010 |
4 | 2333010220322020211310 |
5 | 3210112030221231202 |
6 | 43532004554044220 |
7 | 2523432404661345 |
oct | 277045072104564 |
9 | 51436766576363 |
10 | 13130401352052 |
11 | 4202632288636 |
12 | 1580914a19670 |
13 | 743264a55a6a |
14 | 33572c9280cc |
15 | 17b84287976c |
hex | bf128e88974 |
13130401352052 has 24 divisors (see below), whose sum is σ = 30643831713600. Its totient is φ = 4375910656576.
The previous prime is 13130401352027. The next prime is 13130401352071. The reversal of 13130401352052 is 25025310403131.
It is a super-2 number, since 2×131304013520522 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 111162777 + ... + 111280832.
It is an arithmetic number, because the mean of its divisors is an integer number (1276826321400).
Almost surely, 213130401352052 is an apocalyptic number.
13130401352052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13130401352052 is an abundant number, since it is smaller than the sum of its proper divisors (17513430361548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13130401352052 is a wasteful number, since it uses less digits than its factorization.
13130401352052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222448535 (or 222448533 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 30.
Adding to 13130401352052 its reverse (25025310403131), we get a palindrome (38155711755183).
The spelling of 13130401352052 in words is "thirteen trillion, one hundred thirty billion, four hundred one million, three hundred fifty-two thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •