Base | Representation |
---|---|
bin | 1001011000101110001010… |
… | …0110010000000100011111 |
3 | 1100112121112100212211222012 |
4 | 2112023202212100010133 |
5 | 2323042000124414403 |
6 | 33541030354541435 |
7 | 2113421660101124 |
oct | 226134246200437 |
9 | 40477470784865 |
10 | 10320313123103 |
11 | 3319902787365 |
12 | 11a818bb9787b |
13 | 59b2804a5aa9 |
14 | 279711d8474b |
15 | 12d6c5abeed8 |
hex | 962e299011f |
10320313123103 has 4 divisors (see below), whose sum is σ = 10323485678808. Its totient is φ = 10317140567400.
The previous prime is 10320313123093. The next prime is 10320313123177. The reversal of 10320313123103 is 30132131302301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10320313123103 - 212 = 10320313119007 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10320313126103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1586272973 + ... + 1586279478.
It is an arithmetic number, because the mean of its divisors is an integer number (2580871419702).
Almost surely, 210320313123103 is an apocalyptic number.
10320313123103 is a deficient number, since it is larger than the sum of its proper divisors (3172555705).
10320313123103 is an equidigital number, since it uses as much as digits as its factorization.
10320313123103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3172555704.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 10320313123103 its reverse (30132131302301), we get a palindrome (40452444425404).
The spelling of 10320313123103 in words is "ten trillion, three hundred twenty billion, three hundred thirteen million, one hundred twenty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •