Base | Representation |
---|---|
bin | 1001010100100001011… |
… | …00101011110111011111 |
3 | 1010121122010200110110001 |
4 | 10222100230223313133 |
5 | 20221340313304043 |
6 | 403042340355131 |
7 | 32065136252464 |
oct | 4522054536737 |
9 | 1117563613401 |
10 | 320255213023 |
11 | 11390179a679 |
12 | 520989a5aa7 |
13 | 2427a352965 |
14 | 1170129d66b |
15 | 84e5a3d74d |
hex | 4a90b2bddf |
320255213023 has 4 divisors (see below), whose sum is σ = 320256355288. Its totient is φ = 320254070760.
The previous prime is 320255213021. The next prime is 320255213093. The reversal of 320255213023 is 320312552023.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 320255213023 - 21 = 320255213021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 320255212982 and 320255213000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (320255213021) 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, 169993 + ... + 818173.
It is an arithmetic number, because the mean of its divisors is an integer number (80064088822).
Almost surely, 2320255213023 is an apocalyptic number.
320255213023 is a deficient number, since it is larger than the sum of its proper divisors (1142265).
320255213023 is an equidigital number, since it uses as much as digits as its factorization.
320255213023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1142264.
The product of its (nonzero) digits is 10800, while the sum is 28.
Adding to 320255213023 its reverse (320312552023), we get a palindrome (640567765046).
The spelling of 320255213023 in words is "three hundred twenty billion, two hundred fifty-five million, two hundred thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •