Base | Representation |
---|---|
bin | 10111101001101111010010… |
… | …011110110001000001011111 |
3 | 111122022112102201021121000220 |
4 | 113221233102132301001133 |
5 | 102113304302110103203 |
6 | 1005123355320252423 |
7 | 30624303304566462 |
oct | 2751572236610137 |
9 | 448275381247026 |
10 | 104023344222303 |
11 | 30166063a26550 |
12 | b800507611113 |
13 | 4607489412c6c |
14 | 1b98a846452d9 |
15 | c05d44dd1653 |
hex | 5e9bd27b105f |
104023344222303 has 64 divisors (see below), whose sum is σ = 153633744036864. Its totient is φ = 62084292480000.
The previous prime is 104023344222277. The next prime is 104023344222353. The reversal of 104023344222303 is 303222443320401.
It is not a de Polignac number, because 104023344222303 - 217 = 104023344091231 is a prime.
It is a super-2 number, since 2×1040233442223032 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104023344222353) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 285727675 + ... + 286091507.
It is an arithmetic number, because the mean of its divisors is an integer number (2400527250576).
Almost surely, 2104023344222303 is an apocalyptic number.
104023344222303 is a deficient number, since it is larger than the sum of its proper divisors (49610399814561).
104023344222303 is a wasteful number, since it uses less digits than its factorization.
104023344222303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 364496.
The product of its (nonzero) digits is 82944, while the sum is 33.
Adding to 104023344222303 its reverse (303222443320401), we get a palindrome (407245787542704).
The spelling of 104023344222303 in words is "one hundred four trillion, twenty-three billion, three hundred forty-four million, two hundred twenty-two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •