Base | Representation |
---|---|
bin | 10111011111101001100101… |
… | …001001111100011110101011 |
3 | 111112212020211210000202001111 |
4 | 113133221211021330132223 |
5 | 102020424340200004003 |
6 | 1003433053410531151 |
7 | 30523230141602311 |
oct | 2737514511743653 |
9 | 445766753022044 |
10 | 103330020313003 |
11 | 2aa19019727690 |
12 | b70a072896ab7 |
13 | 4586c9612c563 |
14 | 1b732b1c620b1 |
15 | be2cb6eaee6d |
hex | 5dfa6527c7ab |
103330020313003 has 32 divisors (see below), whose sum is σ = 119624384839680. Its totient is φ = 88266829140000.
The previous prime is 103330020312997. The next prime is 103330020313007. The reversal of 103330020313003 is 300313020033301.
It is a cyclic number.
It is not a de Polignac number, because 103330020313003 - 25 = 103330020312971 is a prime.
It is a super-2 number, since 2×1033300203130032 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103330020313007) 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 31 ways as a sum of consecutive naturals, for example, 94239978 + ... + 95330128.
It is an arithmetic number, because the mean of its divisors is an integer number (3738262026240).
Almost surely, 2103330020313003 is an apocalyptic number.
103330020313003 is a deficient number, since it is larger than the sum of its proper divisors (16294364526677).
103330020313003 is a wasteful number, since it uses less digits than its factorization.
103330020313003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1093879.
The product of its (nonzero) digits is 1458, while the sum is 22.
Adding to 103330020313003 its reverse (300313020033301), we get a palindrome (403643040346304).
The spelling of 103330020313003 in words is "one hundred three trillion, three hundred thirty billion, twenty million, three hundred thirteen thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •