Base | Representation |
---|---|
bin | 1001010100010001010… |
… | …00111110000000011111 |
3 | 1010121021201021222212221 |
4 | 10222020220332000133 |
5 | 20221101211133043 |
6 | 403021111010211 |
7 | 32061605165635 |
oct | 4521050760037 |
9 | 1117251258787 |
10 | 320120021023 |
11 | 113842451950 |
12 | 5205b669967 |
13 | 24258339baa |
14 | 116cb34b355 |
15 | 84d8c368ed |
hex | 4a88a3e01f |
320120021023 has 8 divisors (see below), whose sum is σ = 350337569616. Its totient is φ = 290088427200.
The previous prime is 320120021003. The next prime is 320120021119.
320120021023 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-320120021023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 320120020988 and 320120021006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (320120021003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 46485088 + ... + 46491973.
It is an arithmetic number, because the mean of its divisors is an integer number (43792196202).
Almost surely, 2320120021023 is an apocalyptic number.
320120021023 is a deficient number, since it is larger than the sum of its proper divisors (30217548593).
320120021023 is a wasteful number, since it uses less digits than its factorization.
320120021023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92977385.
The product of its (nonzero) digits is 144, while the sum is 16.
It can be divided in two parts, 3201200 and 21023, that added together give a palindrome (3222223).
The spelling of 320120021023 in words is "three hundred twenty billion, one hundred twenty million, twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •