Base | Representation |
---|---|
bin | 100010100101111110101111… |
… | …000010100101000010100001 |
3 | 201221200210010111211121020002 |
4 | 202211332233002211002201 |
5 | 124420210004140340014 |
6 | 1255325442115025345 |
7 | 44022003220354622 |
oct | 4245765702450241 |
9 | 657623114747202 |
10 | 152143563215009 |
11 | 445287a5073383 |
12 | 1509253759b255 |
13 | 66b80cbc63002 |
14 | 297db0582da49 |
15 | 128c90ad75dde |
hex | 8a5faf0a50a1 |
152143563215009 has 4 divisors (see below), whose sum is σ = 152143632282900. Its totient is φ = 152143494147120.
The previous prime is 152143563215003. The next prime is 152143563215027. The reversal of 152143563215009 is 900512365341251.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 27478857552784 + 124664705662225 = 5242028^2 + 11165335^2 .
It is a cyclic number.
It is not a de Polignac number, because 152143563215009 - 212 = 152143563210913 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (152143563215003) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 31117034 + ... + 35672915.
It is an arithmetic number, because the mean of its divisors is an integer number (38035908070725).
Almost surely, 2152143563215009 is an apocalyptic number.
It is an amenable number.
152143563215009 is a deficient number, since it is larger than the sum of its proper divisors (69067891).
152143563215009 is an equidigital number, since it uses as much as digits as its factorization.
152143563215009 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69067890.
The product of its (nonzero) digits is 972000, while the sum is 47.
The spelling of 152143563215009 in words is "one hundred fifty-two trillion, one hundred forty-three billion, five hundred sixty-three million, two hundred fifteen thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •