Base | Representation |
---|---|
bin | 100010111010001011111010… |
… | …010111010000110100010101 |
3 | 202010121112012010100002101010 |
4 | 202322023322113100310111 |
5 | 130110432220422140023 |
6 | 1302311401302322433 |
7 | 44224220412036450 |
oct | 4272137227206425 |
9 | 663545163302333 |
10 | 153532101365013 |
11 | 44a13664713068 |
12 | 15277672129419 |
13 | 6789027056c07 |
14 | 29cadc9aa4497 |
15 | 12b3ac7b17093 |
hex | 8ba2fa5d0d15 |
153532101365013 has 32 divisors (see below), whose sum is σ = 242031135744000. Its totient is φ = 84703835030976.
The previous prime is 153532101364991. The next prime is 153532101365017. The reversal of 153532101365013 is 310563101235351.
153532101365013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 153532101365013 - 224 = 153532084587797 is a prime.
It is a super-2 number, since 2×1535321013650132 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153532101365017) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9399388 + ... + 19884986.
It is an arithmetic number, because the mean of its divisors is an integer number (7563472992000).
Almost surely, 2153532101365013 is an apocalyptic number.
It is an amenable number.
153532101365013 is a deficient number, since it is larger than the sum of its proper divisors (88499034378987).
153532101365013 is a wasteful number, since it uses less digits than its factorization.
153532101365013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10509681.
The product of its (nonzero) digits is 121500, while the sum is 39.
The spelling of 153532101365013 in words is "one hundred fifty-three trillion, five hundred thirty-two billion, one hundred one million, three hundred sixty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •