Base | Representation |
---|---|
bin | 1001001101110100011100… |
… | …0111100000101000111111 |
3 | 1022212201002122201022112101 |
4 | 2103131013013200220333 |
5 | 2312004411334033203 |
6 | 33315013502445531 |
7 | 2064041464246453 |
oct | 223350707405077 |
9 | 38781078638471 |
10 | 10133021002303 |
11 | 3257432208971 |
12 | 1177a202938a7 |
13 | 586702b88c84 |
14 | 27062590a663 |
15 | 1288b30e841d |
hex | 937471e0a3f |
10133021002303 has 16 divisors (see below), whose sum is σ = 10810316687040. Its totient is φ = 9464870592000.
The previous prime is 10133021002289. The next prime is 10133021002343. The reversal of 10133021002303 is 30320012033101.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10133021002303 is a prime.
It is a super-2 number, since 2×101330210023032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10133021002343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 863353 + ... + 4583821.
It is an arithmetic number, because the mean of its divisors is an integer number (675644792940).
Almost surely, 210133021002303 is an apocalyptic number.
10133021002303 is a deficient number, since it is larger than the sum of its proper divisors (677295684737).
10133021002303 is a wasteful number, since it uses less digits than its factorization.
10133021002303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3721698.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 10133021002303 its reverse (30320012033101), we get a palindrome (40453033035404).
The spelling of 10133021002303 in words is "ten trillion, one hundred thirty-three billion, twenty-one million, two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •