Base | Representation |
---|---|
bin | 100010100100000101001010… |
… | …010111100101110001010111 |
3 | 201221020022012002112122002001 |
4 | 202210011022113211301113 |
5 | 124411040133423032320 |
6 | 1255145453020300131 |
7 | 44006402321525140 |
oct | 4244051227456127 |
9 | 657208162478061 |
10 | 152013025205335 |
11 | 444883a8836658 |
12 | 150711866a1647 |
13 | 66a89c7788778 |
14 | 2977680b16ac7 |
15 | 128931ab8c20a |
hex | 8a414a5e5c57 |
152013025205335 has 16 divisors (see below), whose sum is σ = 208478612676096. Its totient is φ = 104235699657888.
The previous prime is 152013025205311. The next prime is 152013025205359. The reversal of 152013025205335 is 533502520310251.
It is an interprime number because it is at equal distance from previous prime (152013025205311) and next prime (152013025205359).
It is a cyclic number.
It is not a de Polignac number, because 152013025205335 - 219 = 152013024681047 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 152013025205294 and 152013025205303.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 35516017 + ... + 39565306.
It is an arithmetic number, because the mean of its divisors is an integer number (13029913292256).
Almost surely, 2152013025205335 is an apocalyptic number.
152013025205335 is a deficient number, since it is larger than the sum of its proper divisors (56465587470761).
152013025205335 is an equidigital number, since it uses as much as digits as its factorization.
152013025205335 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 75139182.
The product of its (nonzero) digits is 135000, while the sum is 37.
Adding to 152013025205335 its reverse (533502520310251), we get a palindrome (685515545515586).
The spelling of 152013025205335 in words is "one hundred fifty-two trillion, thirteen billion, twenty-five million, two hundred five thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •