Base | Representation |
---|---|
bin | 10111011111001111101011… |
… | …100010000010000101110001 |
3 | 111112202121001122000122002111 |
4 | 113133033223202002011301 |
5 | 102020000411230101223 |
6 | 1003412214035245321 |
7 | 30521224031063236 |
oct | 2737175342020561 |
9 | 445677048018074 |
10 | 103302210003313 |
11 | 2aa08248511372 |
12 | b7047b1149841 |
13 | 45844835c92c9 |
14 | 1b71bd456d78d |
15 | be21da71830d |
hex | 5df3eb882171 |
103302210003313 has 4 divisors (see below), whose sum is σ = 108739168424560. Its totient is φ = 97865251582068.
The previous prime is 103302210003253. The next prime is 103302210003347. The reversal of 103302210003313 is 313300012203301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 103302210003313 - 237 = 103164771049841 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103302210003913) 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, 2718479210595 + ... + 2718479210632.
It is an arithmetic number, because the mean of its divisors is an integer number (27184792106140).
Almost surely, 2103302210003313 is an apocalyptic number.
It is an amenable number.
103302210003313 is a deficient number, since it is larger than the sum of its proper divisors (5436958421247).
103302210003313 is an equidigital number, since it uses as much as digits as its factorization.
103302210003313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5436958421246.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 103302210003313 its reverse (313300012203301), we get a palindrome (416602222206614).
The spelling of 103302210003313 in words is "one hundred three trillion, three hundred two billion, two hundred ten million, three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •