Base | Representation |
---|---|
bin | 1000111000101101011… |
… | …0001110010010111100 |
3 | 112121001020221121012120 |
4 | 2032023112032102330 |
5 | 10000122344322413 |
6 | 154044250202540 |
7 | 14013046105461 |
oct | 2161326162274 |
9 | 477036847176 |
10 | 152661714108 |
11 | 5981a615382 |
12 | 25706123450 |
13 | 1151bb4c617 |
14 | 7563099668 |
15 | 3e87600723 |
hex | 238b58e4bc |
152661714108 has 48 divisors (see below), whose sum is σ = 358732550400. Its totient is φ = 50528016000.
The previous prime is 152661714071. The next prime is 152661714109. The reversal of 152661714108 is 801417166251.
152661714108 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 152661714108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152661714109) 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 15 ways as a sum of consecutive naturals, for example, 1107408 + ... + 1237608.
It is an arithmetic number, because the mean of its divisors is an integer number (7473594800).
Almost surely, 2152661714108 is an apocalyptic number.
It is an amenable number.
152661714108 is an abundant number, since it is smaller than the sum of its proper divisors (206070836292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
152661714108 is a wasteful number, since it uses less digits than its factorization.
152661714108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130898 (or 130896 counting only the distinct ones).
The product of its (nonzero) digits is 80640, while the sum is 42.
The spelling of 152661714108 in words is "one hundred fifty-two billion, six hundred sixty-one million, seven hundred fourteen thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •