Base | Representation |
---|---|
bin | 1001000110101010101001… |
… | …1011110000000110110101 |
3 | 1022102221220101122012211110 |
4 | 2101222222123300012311 |
5 | 2303001223044420313 |
6 | 33142331450425233 |
7 | 2052131301212316 |
oct | 221525233600665 |
9 | 38387811565743 |
10 | 10010133201333 |
11 | 320a301257181 |
12 | 1158045432219 |
13 | 577c4a612645 |
14 | 2686c8c4660d |
15 | 1255be862ec3 |
hex | 91aaa6f01b5 |
10010133201333 has 8 divisors (see below), whose sum is σ = 13598671519008. Its totient is φ = 6547508508944.
The previous prime is 10010133201293. The next prime is 10010133201337. The reversal of 10010133201333 is 33310233101001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10010133201333 - 213 = 10010133193141 is a prime.
It is a super-2 number, since 2×100101332013332 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10010133201337) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31478406135 + ... + 31478406452.
It is an arithmetic number, because the mean of its divisors is an integer number (1699833939876).
Almost surely, 210010133201333 is an apocalyptic number.
It is an amenable number.
10010133201333 is a deficient number, since it is larger than the sum of its proper divisors (3588538317675).
10010133201333 is an equidigital number, since it uses as much as digits as its factorization.
10010133201333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62956812643.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 10010133201333 its reverse (33310233101001), we get a palindrome (43320366302334).
The spelling of 10010133201333 in words is "ten trillion, ten billion, one hundred thirty-three million, two hundred one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •