Base | Representation |
---|---|
bin | 10010100101011… |
… | …00111010010010 |
3 | 101212100102011010 |
4 | 21102230322102 |
5 | 304402204430 |
6 | 23245231350 |
7 | 3602051430 |
oct | 1122547222 |
9 | 355312133 |
10 | 155897490 |
11 | 80000101 |
12 | 44262556 |
13 | 263b5348 |
14 | 169c1d50 |
15 | da46cb0 |
hex | 94ace92 |
155897490 has 32 divisors (see below), whose sum is σ = 427605120. Its totient is φ = 35633664.
The previous prime is 155897479. The next prime is 155897501. The reversal of 155897490 is 94798551.
It is an interprime number because it is at equal distance from previous prime (155897479) and next prime (155897501).
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 370975 + ... + 371394.
It is an arithmetic number, because the mean of its divisors is an integer number (13362660).
Almost surely, 2155897490 is an apocalyptic number.
155897490 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
155897490 is an abundant number, since it is smaller than the sum of its proper divisors (271707630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
155897490 is a wasteful number, since it uses less digits than its factorization.
155897490 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 742386.
The product of its (nonzero) digits is 453600, while the sum is 48.
The square root of 155897490 is about 12485.8916381651. The cubic root of 155897490 is about 538.2033223109.
The spelling of 155897490 in words is "one hundred fifty-five million, eight hundred ninety-seven thousand, four hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •