Base | Representation |
---|---|
bin | 100010000011001… |
… | …0011111011111010 |
3 | 2221121211021111210 |
4 | 1010012103323322 |
5 | 4314440131320 |
6 | 305211503550 |
7 | 40212063660 |
oct | 10406237372 |
9 | 2847737453 |
10 | 1142505210 |
11 | 536a07090 |
12 | 27a757bb6 |
13 | 1529138b2 |
14 | aba44c30 |
15 | 6a4800e0 |
hex | 44193efa |
1142505210 has 64 divisors (see below), whose sum is σ = 3418619904. Its totient is φ = 237403200.
The previous prime is 1142505181. The next prime is 1142505211. The reversal of 1142505210 is 125052411.
1142505210 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (1142505211) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 244986 + ... + 249605.
It is an arithmetic number, because the mean of its divisors is an integer number (53415936).
Almost surely, 21142505210 is an apocalyptic number.
1142505210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1142505210 is an abundant number, since it is smaller than the sum of its proper divisors (2276114694).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1142505210 is a wasteful number, since it uses less digits than its factorization.
1142505210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 494619.
The product of its (nonzero) digits is 400, while the sum is 21.
The square root of 1142505210 is about 33800.9646312054. The cubic root of 1142505210 is about 1045.4085869721.
Adding to 1142505210 its reverse (125052411), we get a palindrome (1267557621).
The spelling of 1142505210 in words is "one billion, one hundred forty-two million, five hundred five thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •