Base | Representation |
---|---|
bin | 1100010101000000011101… |
… | …0111111100000011101111 |
3 | 1202222211221002010110000002 |
4 | 3011100013113330003233 |
5 | 3234041210332030444 |
6 | 44455033304454515 |
7 | 2566214353126643 |
oct | 305200727740357 |
9 | 52884832113002 |
10 | 13555040501999 |
11 | 4356729a90a77 |
12 | 162b08377a43b |
13 | 774308c15969 |
14 | 34c0d3180c23 |
15 | 1878e7416d4e |
hex | c54075fc0ef |
13555040501999 has 4 divisors (see below), whose sum is σ = 14352395825664. Its totient is φ = 12757685178336.
The previous prime is 13555040501993. The next prime is 13555040502011. The reversal of 13555040501999 is 99910504055531.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13555040501999 - 228 = 13554772066543 is a prime.
It is a super-3 number, since 3×135550405019993 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13555040501993) 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 3 ways as a sum of consecutive naturals, for example, 398677661807 + ... + 398677661840.
It is an arithmetic number, because the mean of its divisors is an integer number (3588098956416).
Almost surely, 213555040501999 is an apocalyptic number.
13555040501999 is a deficient number, since it is larger than the sum of its proper divisors (797355323665).
13555040501999 is an equidigital number, since it uses as much as digits as its factorization.
13555040501999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 797355323664.
The product of its (nonzero) digits is 5467500, while the sum is 56.
The spelling of 13555040501999 in words is "thirteen trillion, five hundred fifty-five billion, forty million, five hundred one thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •