Base | Representation |
---|---|
bin | 10111011111010000100111… |
… | …101110111110111000011010 |
3 | 111112202200200000120100121102 |
4 | 113133100213232332320122 |
5 | 102020004443311443002 |
6 | 1003412502155511402 |
7 | 30521261044140335 |
oct | 2737204756767032 |
9 | 445680600510542 |
10 | 103303220031002 |
11 | 2aa087166640a2 |
12 | b704a33458562 |
13 | 45845b4937824 |
14 | 1b71c8c76b61c |
15 | be224922aa02 |
hex | 5df427bbee1a |
103303220031002 has 16 divisors (see below), whose sum is σ = 161772161314752. Its totient is φ = 49381393057920.
The previous prime is 103303220030951. The next prime is 103303220031007. The reversal of 103303220031002 is 200130022303301.
It is a super-2 number, since 2×1033032200310022 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103303220031007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 556605824 + ... + 556791387.
It is an arithmetic number, because the mean of its divisors is an integer number (10110760082172).
Almost surely, 2103303220031002 is an apocalyptic number.
103303220031002 is a deficient number, since it is larger than the sum of its proper divisors (58468941283750).
103303220031002 is a wasteful number, since it uses less digits than its factorization.
103303220031002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1113399253.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 103303220031002 its reverse (200130022303301), we get a palindrome (303433242334303).
The spelling of 103303220031002 in words is "one hundred three trillion, three hundred three billion, two hundred twenty million, thirty-one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.869 sec. • engine limits •