Base | Representation |
---|---|
bin | 1000111101001110110… |
… | …0001000010011100010 |
3 | 112201011211202001121020 |
4 | 2033103230020103202 |
5 | 10010114101310130 |
6 | 154404524110310 |
7 | 14055114313011 |
oct | 2172354102342 |
9 | 481154661536 |
10 | 153875416290 |
11 | 5a29272a832 |
12 | 259a4695396 |
13 | 116834307ab |
14 | 763a354a78 |
15 | 4008e45e10 |
hex | 23d3b084e2 |
153875416290 has 32 divisors (see below), whose sum is σ = 370927892160. Its totient is φ = 40852678464.
The previous prime is 153875416283. The next prime is 153875416333. The reversal of 153875416290 is 92614578351.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11290945 + ... + 11304564.
It is an arithmetic number, because the mean of its divisors is an integer number (11591496630).
It is a 1-persistent number, because it is pandigital, but 2⋅153875416290 = 307750832580 is not.
Almost surely, 2153875416290 is an apocalyptic number.
153875416290 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
153875416290 is an abundant number, since it is smaller than the sum of its proper divisors (217052475870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
153875416290 is a wasteful number, since it uses less digits than its factorization.
153875416290 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22595746.
The product of its (nonzero) digits is 1814400, while the sum is 51.
The spelling of 153875416290 in words is "one hundred fifty-three billion, eight hundred seventy-five million, four hundred sixteen thousand, two hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •