Base | Representation |
---|---|
bin | 1001001101110101001001… |
… | …1000111110101110000010 |
3 | 1022212201120211121001210011 |
4 | 2103131102120332232002 |
5 | 2312010303243200310 |
6 | 33315044340255134 |
7 | 2064046251646156 |
oct | 223352230765602 |
9 | 38781524531704 |
10 | 10133210131330 |
11 | 3257519a46350 |
12 | 1177a736a14aa |
13 | 586733108140 |
14 | 270642a9d066 |
15 | 1288c4a0678a |
hex | 9375263eb82 |
10133210131330 has 128 divisors (see below), whose sum is σ = 22147895266560. Its totient is φ = 3288346813440.
The previous prime is 10133210131309. The next prime is 10133210131393. The reversal of 10133210131330 is 3313101233101.
10133210131330 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 7696941 + ... + 8916799.
It is an arithmetic number, because the mean of its divisors is an integer number (173030431770).
Almost surely, 210133210131330 is an apocalyptic number.
10133210131330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10133210131330 is an abundant number, since it is smaller than the sum of its proper divisors (12014685135230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10133210131330 is a wasteful number, since it uses less digits than its factorization.
10133210131330 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1220084.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 10133210131330 its reverse (3313101233101), we get a palindrome (13446311364431).
The spelling of 10133210131330 in words is "ten trillion, one hundred thirty-three billion, two hundred ten million, one hundred thirty-one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •