Base | Representation |
---|---|
bin | 10111011111010111001111… |
… | …000000001011011000011111 |
3 | 111112210100222220212020202012 |
4 | 113133113033000023120133 |
5 | 102020114014223113043 |
6 | 1003420034552421435 |
7 | 30521632033011434 |
oct | 2737271700133037 |
9 | 445710886766665 |
10 | 103310321301023 |
11 | 2aa107300973a1 |
12 | b7062956a787b |
13 | 4585176c0a355 |
14 | 1b72363929b8b |
15 | be251289aa18 |
hex | 5df5cf00b61f |
103310321301023 has 12 divisors (see below), whose sum is σ = 103451174643960. Its totient is φ = 103169591188416.
The previous prime is 103310321300941. The next prime is 103310321301037. The reversal of 103310321301023 is 320103123013301.
It is not a de Polignac number, because 103310321301023 - 242 = 98912274789919 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103310321301023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103310321301043) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4881637640 + ... + 4881658802.
It is an arithmetic number, because the mean of its divisors is an integer number (8620931220330).
Almost surely, 2103310321301023 is an apocalyptic number.
103310321301023 is a deficient number, since it is larger than the sum of its proper divisors (140853342937).
103310321301023 is an frugal number, since it uses more digits than its factorization.
103310321301023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26378 (or 24385 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 103310321301023 its reverse (320103123013301), we get a palindrome (423413444314324).
The spelling of 103310321301023 in words is "one hundred three trillion, three hundred ten billion, three hundred twenty-one million, three hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •