Base | Representation |
---|---|
bin | 1000110110110011010… |
… | …1000000111011101100 |
3 | 112112201120111012002222 |
4 | 2031230311000323230 |
5 | 4443100310122030 |
6 | 153521355534512 |
7 | 13664261021165 |
oct | 2155465007354 |
9 | 475646435088 |
10 | 152149692140 |
11 | 59587597726 |
12 | 255a275a438 |
13 | 11469a48544 |
14 | 751509476c |
15 | 3e576b03e5 |
hex | 236cd40eec |
152149692140 has 24 divisors (see below), whose sum is σ = 319524328032. Its totient is φ = 60857976960.
The previous prime is 152149692139. The next prime is 152149692151. The reversal of 152149692140 is 41296941251.
152149692140 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 152149692091 and 152149692100.
It is an unprimeable number.
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, 663680 + ... + 863000.
It is an arithmetic number, because the mean of its divisors is an integer number (13313513668).
Almost surely, 2152149692140 is an apocalyptic number.
152149692140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
152149692140 is an abundant number, since it is smaller than the sum of its proper divisors (167374635892).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
152149692140 is a wasteful number, since it uses less digits than its factorization.
152149692140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237497 (or 237495 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 44.
The spelling of 152149692140 in words is "one hundred fifty-two billion, one hundred forty-nine million, six hundred ninety-two thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •