Base | Representation |
---|---|
bin | 1100001101011010001101… |
… | …0100000101011000010011 |
3 | 1202112101000101010200021112 |
4 | 3003112203110011120103 |
5 | 3224421400231013443 |
6 | 44315045214043535 |
7 | 2553613640425205 |
oct | 303264324053023 |
9 | 52471011120245 |
10 | 13424512751123 |
11 | 43063385208a1 |
12 | 16099161a95ab |
13 | 764c068c0a06 |
14 | 345a6d978775 |
15 | 1843080a7b18 |
hex | c35a3505613 |
13424512751123 has 8 divisors (see below), whose sum is σ = 13447907352576. Its totient is φ = 13401129616200.
The previous prime is 13424512751107. The next prime is 13424512751149. The reversal of 13424512751123 is 32115721542431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13424512751123 - 24 = 13424512751107 is a prime.
It is a super-2 number, since 2×134245127511232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13424512753123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 521411 + ... + 5207772.
It is an arithmetic number, because the mean of its divisors is an integer number (1680988419072).
Almost surely, 213424512751123 is an apocalyptic number.
13424512751123 is a deficient number, since it is larger than the sum of its proper divisors (23394601453).
13424512751123 is an equidigital number, since it uses as much as digits as its factorization.
13424512751123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5733265.
The product of its digits is 201600, while the sum is 41.
The spelling of 13424512751123 in words is "thirteen trillion, four hundred twenty-four billion, five hundred twelve million, seven hundred fifty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •