Base | Representation |
---|---|
bin | 1001010100001111100… |
… | …00000101101110010111 |
3 | 1010121020200020110101111 |
4 | 10222013300011232113 |
5 | 20221033402013143 |
6 | 403015415235451 |
7 | 32061334354540 |
oct | 4520760055627 |
9 | 1117220213344 |
10 | 320105110423 |
11 | 113834a9833a |
12 | 52056678b87 |
13 | 24255219157 |
14 | 116c93894c7 |
15 | 84d778d99d |
hex | 4a87c05b97 |
320105110423 has 8 divisors (see below), whose sum is σ = 365846901248. Its totient is φ = 274366441944.
The previous prime is 320105110349. The next prime is 320105110433. The reversal of 320105110423 is 324011501023.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 320105110423 - 221 = 320103013271 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 320105110394 and 320105110403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (320105110433) 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 7 ways as a sum of consecutive naturals, for example, 556611 + ... + 974692.
It is an arithmetic number, because the mean of its divisors is an integer number (45730862656).
Almost surely, 2320105110423 is an apocalyptic number.
320105110423 is a deficient number, since it is larger than the sum of its proper divisors (45741790825).
320105110423 is a wasteful number, since it uses less digits than its factorization.
320105110423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1561173.
The product of its (nonzero) digits is 720, while the sum is 22.
Adding to 320105110423 its reverse (324011501023), we get a palindrome (644116611446).
The spelling of 320105110423 in words is "three hundred twenty billion, one hundred five million, one hundred ten thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •