Base | Representation |
---|---|
bin | 10010110101011010… |
… | …010001001100001001 |
3 | 1221012101221202120000 |
4 | 102311122101030021 |
5 | 312404144301213 |
6 | 13142430153213 |
7 | 1314104221332 |
oct | 226532211411 |
9 | 57171852500 |
10 | 20223431433 |
11 | 86386663a7 |
12 | 3b04952809 |
13 | 1ba3a7719a |
14 | d9bc47289 |
15 | 7d56a2c73 |
hex | 4b5691309 |
20223431433 has 10 divisors (see below), whose sum is σ = 30210311274. Its totient is φ = 13482287568.
The previous prime is 20223431429. The next prime is 20223431441. The reversal of 20223431433 is 33413432202.
20223431433 is a `hidden beast` number, since 2 + 0 + 223 + 4 + 3 + 1 + 433 = 666.
It can be written as a sum of positive squares in only one way, i.e., 18439467264 + 1783964169 = 135792^2 + 42237^2 .
It is not a de Polignac number, because 20223431433 - 22 = 20223431429 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 = 20223431397 and 20223431406.
It is not an unprimeable number, because it can be changed into a prime (20223431233) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 124835916 + ... + 124836077.
Almost surely, 220223431433 is an apocalyptic number.
It is an amenable number.
20223431433 is a deficient number, since it is larger than the sum of its proper divisors (9986879841).
20223431433 is an equidigital number, since it uses as much as digits as its factorization.
20223431433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 249672005 (or 249671996 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 27.
Adding to 20223431433 its reverse (33413432202), we get a palindrome (53636863635).
The spelling of 20223431433 in words is "twenty billion, two hundred twenty-three million, four hundred thirty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •