Base | Representation |
---|---|
bin | 1001010100001111010… |
… | …01001110011101110111 |
3 | 1010121020112212001100110 |
4 | 10222013221032131313 |
5 | 20221032421424343 |
6 | 403015312514103 |
7 | 32061313152213 |
oct | 4520751163567 |
9 | 1117215761313 |
10 | 320103311223 |
11 | 113833a795a3 |
12 | 52055b4b933 |
13 | 24254a39237 |
14 | 116c903b943 |
15 | 84d7535833 |
hex | 4a87a4e777 |
320103311223 has 4 divisors (see below), whose sum is σ = 426804414968. Its totient is φ = 213402207480.
The previous prime is 320103311173. The next prime is 320103311257. The reversal of 320103311223 is 322113301023.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 320103311223 - 216 = 320103245687 is a prime.
It is a super-2 number, since 2×3201033112232 (a number of 24 digits) contains 22 as substring.
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 320103311223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (320103311263) 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, 53350551868 + ... + 53350551873.
It is an arithmetic number, because the mean of its divisors is an integer number (106701103742).
Almost surely, 2320103311223 is an apocalyptic number.
320103311223 is a deficient number, since it is larger than the sum of its proper divisors (106701103745).
320103311223 is a wasteful number, since it uses less digits than its factorization.
320103311223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 106701103744.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 320103311223 its reverse (322113301023), we get a palindrome (642216612246).
The spelling of 320103311223 in words is "three hundred twenty billion, one hundred three million, three hundred eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •