Base | Representation |
---|---|
bin | 10011000001001010… |
… | …01101110010010000 |
3 | 222100120111010202211 |
4 | 21200211031302100 |
5 | 131402314144440 |
6 | 4405054121504 |
7 | 511010100403 |
oct | 114045156220 |
9 | 28316433684 |
10 | 10210303120 |
11 | 436a4a4946 |
12 | 1b8b4b0294 |
13 | c694412a4 |
14 | 6cc067d3a |
15 | 3eb59eeea |
hex | 26094dc90 |
10210303120 has 40 divisors (see below), whose sum is σ = 23912257464. Its totient is φ = 4054305792.
The previous prime is 10210303111. The next prime is 10210303133. The reversal of 10210303120 is 2130301201.
It can be written as a sum of positive squares in 4 ways, for example, as 312440976 + 9897862144 = 17676^2 + 99488^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a self number, because there is not a number n which added to its sum of digits gives 10210303120.
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 7 ways as a sum of consecutive naturals, for example, 454839 + ... + 476758.
Almost surely, 210210303120 is an apocalyptic number.
10210303120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10210303120 is an abundant number, since it is smaller than the sum of its proper divisors (13701954344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10210303120 is a wasteful number, since it uses less digits than its factorization.
10210303120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 931747 (or 931741 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 10210303120 its reverse (2130301201), we get a palindrome (12340604321).
The spelling of 10210303120 in words is "ten billion, two hundred ten million, three hundred three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •