Base | Representation |
---|---|
bin | 11101011001011101101… |
… | …10011011000111001000 |
3 | 10120120020211121221021102 |
4 | 32230232312123013020 |
5 | 113022142423131240 |
6 | 2052011324000532 |
7 | 132656205445214 |
oct | 16545666330710 |
9 | 3516224557242 |
10 | 1010103333320 |
11 | 35a422aa8844 |
12 | 143921690148 |
13 | 743384c5a93 |
14 | 36c641c7944 |
15 | 1b41d736815 |
hex | eb2ed9b1c8 |
1010103333320 has 32 divisors (see below), whose sum is σ = 2311253395200. Its totient is φ = 397193174208.
The previous prime is 1010103333271. The next prime is 1010103333341. The reversal of 1010103333320 is 233333010101.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 1010103333292 and 1010103333301.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 214002584 + ... + 214007303.
It is an arithmetic number, because the mean of its divisors is an integer number (72226668600).
Almost surely, 21010103333320 is an apocalyptic number.
1010103333320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1010103333320 is an abundant number, since it is smaller than the sum of its proper divisors (1301150061880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010103333320 is a wasteful number, since it uses less digits than its factorization.
1010103333320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 428009957 (or 428009953 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 1010103333320 its reverse (233333010101), we get a palindrome (1243436343421).
The spelling of 1010103333320 in words is "one trillion, ten billion, one hundred three million, three hundred thirty-three thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •