Base | Representation |
---|---|
bin | 1001010100010001110… |
… | …01000001101100100001 |
3 | 1010121022000012212010000 |
4 | 10222020321001230201 |
5 | 20221103300333213 |
6 | 403021341130213 |
7 | 32061656030160 |
oct | 4521071015441 |
9 | 1117260185100 |
10 | 320124230433 |
11 | 1138448674a7 |
12 | 52060b59969 |
13 | 24259181b77 |
14 | 116cbb253d7 |
15 | 84d92b8c73 |
hex | 4a88e41b21 |
320124230433 has 160 divisors (see below), whose sum is σ = 589951549440. Its totient is φ = 168914782080.
The previous prime is 320124230429. The next prime is 320124230441. The reversal of 320124230433 is 334032421023.
320124230433 is a `hidden beast` number, since 3 + 201 + 2 + 4 + 23 + 0 + 433 = 666.
It is not a de Polignac number, because 320124230433 - 22 = 320124230429 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 320124230397 and 320124230406.
It is not an unprimeable number, because it can be changed into a prime (320124230033) by changing a digit.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 137214535 + ... + 137216867.
It is an arithmetic number, because the mean of its divisors is an integer number (3687197184).
Almost surely, 2320124230433 is an apocalyptic number.
It is an amenable number.
320124230433 is a deficient number, since it is larger than the sum of its proper divisors (269827319007).
320124230433 is a wasteful number, since it uses less digits than its factorization.
320124230433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2689 (or 2680 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 27.
Adding to 320124230433 its reverse (334032421023), we get a palindrome (654156651456).
The spelling of 320124230433 in words is "three hundred twenty billion, one hundred twenty-four million, two hundred thirty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •