Base | Representation |
---|---|
bin | 11101011001110110101… |
… | …10010000000011001010 |
3 | 10120120210110011021021220 |
4 | 32230323112100003022 |
5 | 113023110112100320 |
6 | 2052044213542510 |
7 | 132664332555540 |
oct | 16547326200312 |
9 | 3516713137256 |
10 | 1010313003210 |
11 | 35a520395945 |
12 | 14397b944a36 |
13 | 7436ca875c4 |
14 | 36c83da5d90 |
15 | 1b431d50e40 |
hex | eb3b5900ca |
1010313003210 has 64 divisors (see below), whose sum is σ = 2916993945600. Its totient is φ = 218774544192.
The previous prime is 1010313003197. The next prime is 1010313003221. The reversal of 1010313003210 is 123003130101.
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 1010313003210.
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 31 ways as a sum of consecutive naturals, for example, 126601650 + ... + 126609629.
It is an arithmetic number, because the mean of its divisors is an integer number (45578030400).
Almost surely, 21010313003210 is an apocalyptic number.
1010313003210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1010313003210 is an abundant number, since it is smaller than the sum of its proper divisors (1906680942390).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010313003210 is a wasteful number, since it uses less digits than its factorization.
1010313003210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 253211315.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 1010313003210 its reverse (123003130101), we get a palindrome (1133316133311).
The spelling of 1010313003210 in words is "one trillion, ten billion, three hundred thirteen million, three thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •