Base | Representation |
---|---|
bin | 1011110101011010101011… |
… | …1101010100011111100000 |
3 | 1201001222002020112202112001 |
4 | 2331112222331110133200 |
5 | 3201143214440003044 |
6 | 43401440145413344 |
7 | 2512052344151605 |
oct | 275265275243740 |
9 | 51058066482461 |
10 | 13012324141024 |
11 | 416754a82430a |
12 | 1561a6103a254 |
13 | 735098020c60 |
14 | 32db2aadc6ac |
15 | 1787315d42d4 |
hex | bd5aaf547e0 |
13012324141024 has 48 divisors (see below), whose sum is σ = 27591424731360. Its totient is φ = 6005079590400.
The previous prime is 13012324141013. The next prime is 13012324141051. The reversal of 13012324141024 is 42014142321031.
It is a happy number.
It is a super-3 number, since 3×130123241410243 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13012324140983 and 13012324141001.
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, 2539197 + ... + 5698435.
It is an arithmetic number, because the mean of its divisors is an integer number (574821348570).
Almost surely, 213012324141024 is an apocalyptic number.
It is an amenable number.
13012324141024 is an abundant number, since it is smaller than the sum of its proper divisors (14579100590336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13012324141024 is a wasteful number, since it uses less digits than its factorization.
13012324141024 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3169163 (or 3169155 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 13012324141024 its reverse (42014142321031), we get a palindrome (55026466462055).
The spelling of 13012324141024 in words is "thirteen trillion, twelve billion, three hundred twenty-four million, one hundred forty-one thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •