Base | Representation |
---|---|
bin | 10011000100101… |
… | …101000000010111 |
3 | 211022010200111201 |
4 | 103010231000113 |
5 | 1123410000043 |
6 | 51430413331 |
7 | 10633645450 |
oct | 2304550027 |
9 | 738120451 |
10 | 320000023 |
11 | 1546a4832 |
12 | 8b201247 |
13 | 513b1235 |
14 | 306dc127 |
15 | 1d15ec4d |
hex | 1312d017 |
320000023 has 8 divisors (see below), whose sum is σ = 374219648. Its totient is φ = 267906744.
The previous prime is 319999969. The next prime is 320000077.
320000023 is nontrivially palindromic in base 10.
It is an interprime number because it is at equal distance from previous prime (319999969) and next prime (320000077).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 320000023 - 213 = 319991831 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 319999964 and 320000009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (320060023) 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, 531261 + ... + 531862.
It is an arithmetic number, because the mean of its divisors is an integer number (46777456).
Almost surely, 2320000023 is an apocalyptic number.
320000023 is a deficient number, since it is larger than the sum of its proper divisors (54219625).
320000023 is a wasteful number, since it uses less digits than its factorization.
320000023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1063173.
The product of its (nonzero) digits is 36, while the sum is 10.
The square root of 320000023 is about 17888.5444628678. The cubic root of 320000023 is about 683.9903950579.
It can be divided in two parts, 3200000 and 23, that added together give a palindrome (3200023).
The spelling of 320000023 in words is "three hundred twenty million, twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •