Base | Representation |
---|---|
bin | 110110110101111… |
… | …0110100010111001 |
3 | 11202020200110111200 |
4 | 1231223312202321 |
5 | 12232043242103 |
6 | 502334044413 |
7 | 63413355003 |
oct | 15553664271 |
9 | 4666613450 |
10 | 1840212153 |
11 | 86482a69a |
12 | 434349709 |
13 | 23432c340 |
14 | 136583373 |
15 | ab84d0a3 |
hex | 6daf68b9 |
1840212153 has 12 divisors (see below), whose sum is σ = 2862552420. Its totient is φ = 1132438176.
The previous prime is 1840212137. The next prime is 1840212161. The reversal of 1840212153 is 3512120481.
It can be written as a sum of positive squares in 2 ways, for example, as 451010169 + 1389201984 = 21237^2 + 37272^2 .
It is not a de Polignac number, because 1840212153 - 24 = 1840212137 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1840212653) 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 11 ways as a sum of consecutive naturals, for example, 7864038 + ... + 7864271.
It is an arithmetic number, because the mean of its divisors is an integer number (238546035).
Almost surely, 21840212153 is an apocalyptic number.
1840212153 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1840212153 is a deficient number, since it is larger than the sum of its proper divisors (1022340267).
1840212153 is a wasteful number, since it uses less digits than its factorization.
1840212153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15728328 (or 15728325 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 27.
The square root of 1840212153 is about 42897.6940289335. The cubic root of 1840212153 is about 1225.4322290931.
The spelling of 1840212153 in words is "one billion, eight hundred forty million, two hundred twelve thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •