Base | Representation |
---|---|
bin | 1100100101111000111011… |
… | …0111001011001000011111 |
3 | 1211000120120011212211020122 |
4 | 3021132032313023020133 |
5 | 3303314204031020244 |
6 | 45240201301105155 |
7 | 2626162620600020 |
oct | 311361667131037 |
9 | 54016504784218 |
10 | 13845076423199 |
11 | 44587337783aa |
12 | 16773280b81bb |
13 | 79577b623248 |
14 | 35c168c30c47 |
15 | 19021ee611ee |
hex | c978edcb21f |
13845076423199 has 16 divisors (see below), whose sum is σ = 15885904845888. Its totient is φ = 11820049631232.
The previous prime is 13845076423177. The next prime is 13845076423229. The reversal of 13845076423199 is 99132467054831.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 13845076423199 - 212 = 13845076419103 is a prime.
It is a super-2 number, since 2×138450764231992 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13845076423999) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 137117 + ... + 5263929.
It is an arithmetic number, because the mean of its divisors is an integer number (992869052868).
It is a 2-persistent number, because it is pandigital, and so is 2⋅13845076423199 = 27690152846398, but 3⋅13845076423199 = 41535229269597 is not.
Almost surely, 213845076423199 is an apocalyptic number.
13845076423199 is a deficient number, since it is larger than the sum of its proper divisors (2040828422689).
13845076423199 is a wasteful number, since it uses less digits than its factorization.
13845076423199 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5128354.
The product of its (nonzero) digits is 39191040, while the sum is 62.
The spelling of 13845076423199 in words is "thirteen trillion, eight hundred forty-five billion, seventy-six million, four hundred twenty-three thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •