Base | Representation |
---|---|
bin | 1100110101000011011101… |
… | …0001000010101101110001 |
3 | 1211221111000111121100101202 |
4 | 3031100313101002231301 |
5 | 3322101232023031023 |
6 | 50000004553340545 |
7 | 2654044625100644 |
oct | 315206721025561 |
9 | 54844014540352 |
10 | 14105599814513 |
11 | 45491733aa269 |
12 | 16b9914a07755 |
13 | 7b41c99545ac |
14 | 36aa010c9a5b |
15 | 196dbba72128 |
hex | cd437442b71 |
14105599814513 has 2 divisors, whose sum is σ = 14105599814514. Its totient is φ = 14105599814512.
The previous prime is 14105599814479. The next prime is 14105599814609. The reversal of 14105599814513 is 31541899550141.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14093507073424 + 12092741089 = 3754132^2 + 109967^2 .
It is an emirp because it is prime and its reverse (31541899550141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14105599814513 - 210 = 14105599813489 is a prime.
It is a super-2 number, since 2×141055998145132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (14105599817513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7052799907256 + 7052799907257.
It is an arithmetic number, because the mean of its divisors is an integer number (7052799907257).
Almost surely, 214105599814513 is an apocalyptic number.
It is an amenable number.
14105599814513 is a deficient number, since it is larger than the sum of its proper divisors (1).
14105599814513 is an equidigital number, since it uses as much as digits as its factorization.
14105599814513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888000, while the sum is 56.
The spelling of 14105599814513 in words is "fourteen trillion, one hundred five billion, five hundred ninety-nine million, eight hundred fourteen thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •