Base | Representation |
---|---|
bin | 11101010000001111011… |
… | …110110100010000100100 |
3 | 21010011221120110012002212 |
4 | 131100033132310100210 |
5 | 230414100413244030 |
6 | 4135304320422552 |
7 | 265145134503245 |
oct | 35201736642044 |
9 | 7104846405085 |
10 | 2010304431140 |
11 | 705624496485 |
12 | 28573aa77a58 |
13 | 1177563414c5 |
14 | 6d42921accc |
15 | 3745c972595 |
hex | 1d40f7b4424 |
2010304431140 has 24 divisors (see below), whose sum is σ = 4293192516480. Its totient is φ = 790492589408.
The previous prime is 2010304431103. The next prime is 2010304431151. The reversal of 2010304431140 is 411344030102.
It is a super-2 number, since 2×20103044311402 (a number of 25 digits) contains 22 as substring.
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 7 ways as a sum of consecutive naturals, for example, 851822732 + ... + 851825091.
It is an arithmetic number, because the mean of its divisors is an integer number (178883021520).
Almost surely, 22010304431140 is an apocalyptic number.
2010304431140 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2010304431140 is an abundant number, since it is smaller than the sum of its proper divisors (2282888085340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2010304431140 is a wasteful number, since it uses less digits than its factorization.
2010304431140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1703647891 (or 1703647889 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 2010304431140 its reverse (411344030102), we get a palindrome (2421648461242).
The spelling of 2010304431140 in words is "two trillion, ten billion, three hundred four million, four hundred thirty-one thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •