Base | Representation |
---|---|
bin | 1001001101110101011111… |
… | …1011110000010000010010 |
3 | 1022212201211022121001100221 |
4 | 2103131113323300100102 |
5 | 2312011001100230302 |
6 | 33315101501503254 |
7 | 2064051461313514 |
oct | 223352773602022 |
9 | 38781738531327 |
10 | 10133303133202 |
11 | 3257567497aa7 |
12 | 1177a9a871b2a |
13 | 58674946b532 |
14 | 27065118bbb4 |
15 | 1288ccc77937 |
hex | 93757ef0412 |
10133303133202 has 8 divisors (see below), whose sum is σ = 15201921845376. Its totient is φ = 5065995851412.
The previous prime is 10133303133197. The next prime is 10133303133203. The reversal of 10133303133202 is 20233130333101.
10133303133202 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×101333031332022 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10133303133203) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 327838278 + ... + 327869185.
It is an arithmetic number, because the mean of its divisors is an integer number (1900240230672).
Almost surely, 210133303133202 is an apocalyptic number.
10133303133202 is a deficient number, since it is larger than the sum of its proper divisors (5068618712174).
10133303133202 is an equidigital number, since it uses as much as digits as its factorization.
10133303133202 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 655715192.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 10133303133202 its reverse (20233130333101), we get a palindrome (30366433466303).
The spelling of 10133303133202 in words is "ten trillion, one hundred thirty-three billion, three hundred three million, one hundred thirty-three thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •