Base | Representation |
---|---|
bin | 10010110110100110… |
… | …001001001001011001 |
3 | 1221020210101021111200 |
4 | 102312212021021121 |
5 | 312424242241213 |
6 | 13144420344413 |
7 | 1314435251556 |
oct | 226646111131 |
9 | 57223337450 |
10 | 20243321433 |
11 | 8648911015 |
12 | 3b0b545109 |
13 | 1ba7c1c50a |
14 | da0743a2d |
15 | 7d72d1273 |
hex | 4b6989259 |
20243321433 has 24 divisors (see below), whose sum is σ = 29910928320. Its totient is φ = 13188084000.
The previous prime is 20243321419. The next prime is 20243321447. The reversal of 20243321433 is 33412334202.
20243321433 is a `hidden beast` number, since 202 + 4 + 3 + 3 + 21 + 433 = 666.
It is an interprime number because it is at equal distance from previous prime (20243321419) and next prime (20243321447).
It is not a de Polignac number, because 20243321433 - 26 = 20243321369 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20243321397 and 20243321406.
It is not an unprimeable number, because it can be changed into a prime (20243321473) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 35188 + ... + 204266.
It is an arithmetic number, because the mean of its divisors is an integer number (1246288680).
Almost surely, 220243321433 is an apocalyptic number.
It is an amenable number.
20243321433 is a deficient number, since it is larger than the sum of its proper divisors (9667606887).
20243321433 is a wasteful number, since it uses less digits than its factorization.
20243321433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 169389 (or 169386 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 27.
Adding to 20243321433 its reverse (33412334202), we get a palindrome (53655655635).
The spelling of 20243321433 in words is "twenty billion, two hundred forty-three million, three hundred twenty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •