Base | Representation |
---|---|
bin | 10111011111001110100011… |
… | …011111010010001000001111 |
3 | 111112202110221101200022102211 |
4 | 113133032203133102020033 |
5 | 102014440422314314043 |
6 | 1003411454101131251 |
7 | 30521152053343060 |
oct | 2737164337221017 |
9 | 445673841608384 |
10 | 103301001323023 |
11 | 2aa07788216a39 |
12 | b7045143b9b27 |
13 | 4584320085b7a |
14 | 1b71b1bc20567 |
15 | be2169565a9d |
hex | 5df3a37d220f |
103301001323023 has 8 divisors (see below), whose sum is σ = 118237434860160. Its totient is φ = 88409354694360.
The previous prime is 103301001323021. The next prime is 103301001323027. The reversal of 103301001323023 is 320323100103301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103301001323023 - 21 = 103301001323021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103301001322985 and 103301001323003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103301001323021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11196722173 + ... + 11196731398.
It is an arithmetic number, because the mean of its divisors is an integer number (14779679357520).
Almost surely, 2103301001323023 is an apocalyptic number.
103301001323023 is a deficient number, since it is larger than the sum of its proper divisors (14936433537137).
103301001323023 is an equidigital number, since it uses as much as digits as its factorization.
103301001323023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22393454237.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 103301001323023 its reverse (320323100103301), we get a palindrome (423624101426324).
The spelling of 103301001323023 in words is "one hundred three trillion, three hundred one billion, one million, three hundred twenty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •