Base | Representation |
---|---|
bin | 10011001101000011… |
… | …00010101000010100 |
3 | 222121112002102121010 |
4 | 21212201202220110 |
5 | 132103330100340 |
6 | 4423015052220 |
7 | 513330403266 |
oct | 114641425024 |
9 | 28545072533 |
10 | 10310003220 |
11 | 4410801020 |
12 | 1bb8971070 |
13 | c83cab42a |
14 | 6db3bbb36 |
15 | 4051e5b80 |
hex | 266862a14 |
10310003220 has 48 divisors (see below), whose sum is σ = 31492375488. Its totient is φ = 2499394560.
The previous prime is 10310003201. The next prime is 10310003261. The reversal of 10310003220 is 2230001301.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 10310003196 and 10310003205.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 7809949 + ... + 7811268.
It is an arithmetic number, because the mean of its divisors is an integer number (656091156).
Almost surely, 210310003220 is an apocalyptic number.
10310003220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10310003220 is an abundant number, since it is smaller than the sum of its proper divisors (21182372268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10310003220 is a wasteful number, since it uses less digits than its factorization.
10310003220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15621240 (or 15621238 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 10310003220 its reverse (2230001301), we get a palindrome (12540004521).
The spelling of 10310003220 in words is "ten billion, three hundred ten million, three thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •