Base | Representation |
---|---|
bin | 11001100100100001… |
… | …01111111111111111 |
3 | 1022102201221110102022 |
4 | 30302100233333333 |
5 | 211103401403344 |
6 | 10150121550355 |
7 | 664124244266 |
oct | 146220577777 |
9 | 38381843368 |
10 | 13728153599 |
11 | 5905203a96 |
12 | 27b16453bb |
13 | 13aa1ba814 |
14 | 9433515dd |
15 | 5553360ee |
hex | 33242ffff |
13728153599 has 8 divisors (see below), whose sum is σ = 14536724688. Its totient is φ = 12919697280.
The previous prime is 13728153587. The next prime is 13728153611. The reversal of 13728153599 is 99535182731.
It is an interprime number because it is at equal distance from previous prime (13728153587) and next prime (13728153611).
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 13728153599 - 212 = 13728149503 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13728153599.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13728153799) 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 7 ways as a sum of consecutive naturals, for example, 404984 + ... + 437570.
It is an arithmetic number, because the mean of its divisors is an integer number (1817090586).
Almost surely, 213728153599 is an apocalyptic number.
13728153599 is a deficient number, since it is larger than the sum of its proper divisors (808571089).
13728153599 is a wasteful number, since it uses less digits than its factorization.
13728153599 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57385.
The product of its digits is 2041200, while the sum is 53.
The spelling of 13728153599 in words is "thirteen billion, seven hundred twenty-eight million, one hundred fifty-three thousand, five hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •