Base | Representation |
---|---|
bin | 1000111000110000001… |
… | …0110110011111001110 |
3 | 112121002001221222011110 |
4 | 2032030002312133032 |
5 | 10000133343204240 |
6 | 154045345032450 |
7 | 14013250412313 |
oct | 2161402663716 |
9 | 477061858143 |
10 | 152673413070 |
11 | 59826185a42 |
12 | 2570a025726 |
13 | 115213b7599 |
14 | 7564862d0a |
15 | 3e88661c80 |
hex | 238c0b67ce |
152673413070 has 32 divisors (see below), whose sum is σ = 374937501312. Its totient is φ = 39766097952.
The previous prime is 152673412993. The next prime is 152673413099. The reversal of 152673413070 is 70314376251.
152673413070 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 59174452 + ... + 59177031.
It is an arithmetic number, because the mean of its divisors is an integer number (11716796916).
Almost surely, 2152673413070 is an apocalyptic number.
152673413070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
152673413070 is an abundant number, since it is smaller than the sum of its proper divisors (222264088242).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
152673413070 is a wasteful number, since it uses less digits than its factorization.
152673413070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118351536.
The product of its (nonzero) digits is 105840, while the sum is 39.
The spelling of 152673413070 in words is "one hundred fifty-two billion, six hundred seventy-three million, four hundred thirteen thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •