Base | Representation |
---|---|
bin | 1000110111100000101… |
… | …1100110101010001101 |
3 | 112120012211220010022011 |
4 | 2031320023212222031 |
5 | 4443443040210323 |
6 | 153552322221221 |
7 | 14002063010350 |
oct | 2157013465215 |
9 | 476184803264 |
10 | 152340163213 |
11 | 59675061437 |
12 | 256364b4811 |
13 | 1149a347514 |
14 | 75324b6297 |
15 | 3e6928620d |
hex | 23782e6a8d |
152340163213 has 8 divisors (see below), whose sum is σ = 183266361920. Its totient is φ = 123704794080.
The previous prime is 152340163187. The next prime is 152340163229. The reversal of 152340163213 is 312361043251.
152340163213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-152340163213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152340163253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 572707248 + ... + 572707513.
It is an arithmetic number, because the mean of its divisors is an integer number (22908295240).
Almost surely, 2152340163213 is an apocalyptic number.
It is an amenable number.
152340163213 is a deficient number, since it is larger than the sum of its proper divisors (30926198707).
152340163213 is a wasteful number, since it uses less digits than its factorization.
152340163213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1145414787.
The product of its (nonzero) digits is 12960, while the sum is 31.
The spelling of 152340163213 in words is "one hundred fifty-two billion, three hundred forty million, one hundred sixty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •