Base | Representation |
---|---|
bin | 10010110110001000… |
… | …011111111011100001 |
3 | 1221020020202110200212 |
4 | 102312020133323201 |
5 | 312420300103213 |
6 | 13143542023505 |
7 | 1314312224600 |
oct | 226610377341 |
9 | 57206673625 |
10 | 20235550433 |
11 | 86444935aa |
12 | 3b08a17b95 |
13 | 1ba642b3a7 |
14 | d9d6bda37 |
15 | 7d67989a8 |
hex | 4b621fee1 |
20235550433 has 12 divisors (see below), whose sum is σ = 23861774340. Its totient is φ = 17107155072.
The previous prime is 20235550367. The next prime is 20235550441. The reversal of 20235550433 is 33405553202.
It can be written as a sum of positive squares in 2 ways, for example, as 3773890624 + 16461659809 = 61432^2 + 128303^2 .
It is not a de Polignac number, because 20235550433 - 210 = 20235549409 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 20235550433.
It is not an unprimeable number, because it can be changed into a prime (20235550633) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2824988 + ... + 2832141.
It is an arithmetic number, because the mean of its divisors is an integer number (1988481195).
Almost surely, 220235550433 is an apocalyptic number.
It is an amenable number.
20235550433 is a deficient number, since it is larger than the sum of its proper divisors (3626223907).
20235550433 is an equidigital number, since it uses as much as digits as its factorization.
20235550433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5657216 (or 5657209 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 32.
The spelling of 20235550433 in words is "twenty billion, two hundred thirty-five million, five hundred fifty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •