Base | Representation |
---|---|
bin | 111100111000101001110110… |
… | …1000111010110101111000001 |
3 | 2121020020021102111102101000212 |
4 | 1321301103231013112233001 |
5 | 1030143441034242414103 |
6 | 5135005113310523505 |
7 | 220543233544526663 |
oct | 17161235507265701 |
9 | 2536207374371025 |
10 | 535552040201153 |
11 | 145709387976188 |
12 | 500956a6806595 |
13 | 19caa4576662a1 |
14 | 9636bdda64533 |
15 | 41dae0e5757d8 |
hex | 1e714ed1d6bc1 |
535552040201153 has 16 divisors (see below), whose sum is σ = 554495822173440. Its totient is φ = 516944691956736.
The previous prime is 535552040201141. The next prime is 535552040201159. The reversal of 535552040201153 is 351102040255535.
It is a cyclic number.
It is not a de Polignac number, because 535552040201153 - 234 = 535534860331969 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 535552040201153.
It is not an unprimeable number, because it can be changed into a prime (535552040201159) 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, 116714318 + ... + 121216071.
It is an arithmetic number, because the mean of its divisors is an integer number (34655988885840).
Almost surely, 2535552040201153 is an apocalyptic number.
It is an amenable number.
535552040201153 is a deficient number, since it is larger than the sum of its proper divisors (18943781972287).
535552040201153 is a wasteful number, since it uses less digits than its factorization.
535552040201153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237931096.
The product of its (nonzero) digits is 450000, while the sum is 41.
Adding to 535552040201153 its reverse (351102040255535), we get a palindrome (886654080456688).
The spelling of 535552040201153 in words is "five hundred thirty-five trillion, five hundred fifty-two billion, forty million, two hundred one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •