Base | Representation |
---|---|
bin | 1011111000011011010010… |
… | …0110011100010100111010 |
3 | 1201020220112101211010011012 |
4 | 2332012310212130110322 |
5 | 3203020111013223024 |
6 | 43441310325433522 |
7 | 2515562505515300 |
oct | 276066446342472 |
9 | 51226471733135 |
10 | 13064025523514 |
11 | 4187470914199 |
12 | 156ba8b86b8a2 |
13 | 739c17402584 |
14 | 332433394270 |
15 | 179c5a50250e |
hex | be1b499c53a |
13064025523514 has 192 divisors, whose sum is σ = 24494458060800. Its totient is φ = 5198113388160.
The previous prime is 13064025523477. The next prime is 13064025523517. The reversal of 13064025523514 is 41532552046031.
It is a super-3 number, since 3×130640255235143 (a number of 40 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (13064025523517) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 9338116187 + ... + 9338117585.
It is an arithmetic number, because the mean of its divisors is an integer number (127575302400).
Almost surely, 213064025523514 is an apocalyptic number.
13064025523514 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
13064025523514 is a deficient number, since it is larger than the sum of its proper divisors (11430432537286).
13064025523514 is a wasteful number, since it uses less digits than its factorization.
13064025523514 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2153 (or 2146 counting only the distinct ones).
The product of its (nonzero) digits is 432000, while the sum is 41.
Adding to 13064025523514 its reverse (41532552046031), we get a palindrome (54596577569545).
The spelling of 13064025523514 in words is "thirteen trillion, sixty-four billion, twenty-five million, five hundred twenty-three thousand, five hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •