Base | Representation |
---|---|
bin | 100010101010010110111100… |
… | …101101010111100101010101 |
3 | 201222202112202011001110011012 |
4 | 202222112330231113211111 |
5 | 124440122203200342423 |
6 | 1300120001542022005 |
7 | 44052514225054604 |
oct | 4252267455274525 |
9 | 658675664043135 |
10 | 152444440246613 |
11 | 44634362334489 |
12 | 15120906717905 |
13 | 670a5ab6a5a18 |
14 | 29904c922da3b |
15 | 129566a526078 |
hex | 8aa5bcb57955 |
152444440246613 has 8 divisors (see below), whose sum is σ = 160476142744800. Its totient is φ = 144413568839088.
The previous prime is 152444440246607. The next prime is 152444440246663. The reversal of 152444440246613 is 316642044444251.
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 152444440246613 - 218 = 152444439984469 is a prime.
It is a super-2 number, since 2×1524444402466132 (a number of 29 digits) contains 22 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 (152444440246663) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 207396131 + ... + 208129872.
It is an arithmetic number, because the mean of its divisors is an integer number (20059517843100).
Almost surely, 2152444440246613 is an apocalyptic number.
It is an amenable number.
152444440246613 is a deficient number, since it is larger than the sum of its proper divisors (8031702498187).
152444440246613 is a wasteful number, since it uses less digits than its factorization.
152444440246613 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 415545331.
The product of its (nonzero) digits is 8847360, while the sum is 50.
The spelling of 152444440246613 in words is "one hundred fifty-two trillion, four hundred forty-four billion, four hundred forty million, two hundred forty-six thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •