Base | Representation |
---|---|
bin | 1011111011111011111100… |
… | …0011101100010011101110 |
3 | 1201110200012011021121110211 |
4 | 2332332333003230103232 |
5 | 3210012112102133304 |
6 | 43525122330453034 |
7 | 2523126100432210 |
oct | 276767703542356 |
9 | 51420164247424 |
10 | 13124330505454 |
11 | 41aaaa7468743 |
12 | 157b6bb89417a |
13 | 7428080b303c |
14 | 3353145565b0 |
15 | 17b5d98ea204 |
hex | befbf0ec4ee |
13124330505454 has 8 divisors (see below), whose sum is σ = 22498852295088. Its totient is φ = 5624713073760.
The previous prime is 13124330505439. The next prime is 13124330505467. The reversal of 13124330505454 is 45450503342131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×131243305054542 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 468726089467 + ... + 468726089494.
It is an arithmetic number, because the mean of its divisors is an integer number (2812356536886).
Almost surely, 213124330505454 is an apocalyptic number.
13124330505454 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
13124330505454 is a deficient number, since it is larger than the sum of its proper divisors (9374521789634).
13124330505454 is an equidigital number, since it uses as much as digits as its factorization.
13124330505454 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 937452178970.
The product of its (nonzero) digits is 432000, while the sum is 40.
Adding to 13124330505454 its reverse (45450503342131), we get a palindrome (58574833847585).
The spelling of 13124330505454 in words is "thirteen trillion, one hundred twenty-four billion, three hundred thirty million, five hundred five thousand, four hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •