Base | Representation |
---|---|
bin | 1001000110010000001010… |
… | …1001010010011010001000 |
3 | 1022102021112212221020110120 |
4 | 2101210002221102122020 |
5 | 2302342142420210440 |
6 | 33135154142543240 |
7 | 2051460145246053 |
oct | 221440251223210 |
9 | 38367485836416 |
10 | 10003023210120 |
11 | 3207292907586 |
12 | 11567a0297b20 |
13 | 5773865a8355 |
14 | 268212857a9a |
15 | 12530556ddd0 |
hex | 91902a52688 |
10003023210120 has 64 divisors (see below), whose sum is σ = 30009293406720. Its totient is φ = 2667452964864.
The previous prime is 10003023210113. The next prime is 10003023210133. The reversal of 10003023210120 is 2101232030001.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 10003023210120.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23276232 + ... + 23702088.
It is an arithmetic number, because the mean of its divisors is an integer number (468895209480).
Almost surely, 210003023210120 is an apocalyptic number.
10003023210120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10003023210120 is an abundant number, since it is smaller than the sum of its proper divisors (20006270196600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10003023210120 is a wasteful number, since it uses less digits than its factorization.
10003023210120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 621614 (or 621610 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 10003023210120 its reverse (2101232030001), we get a palindrome (12104255240121).
The spelling of 10003023210120 in words is "ten trillion, three billion, twenty-three million, two hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •