Base | Representation |
---|---|
bin | 10010110101110111… |
… | …111111010010100001 |
3 | 1221012221121120210120 |
4 | 102311313333102201 |
5 | 312413143104213 |
6 | 13143305150453 |
7 | 1314230360532 |
oct | 226567772241 |
9 | 57187546716 |
10 | 20231222433 |
11 | 8641aa7944 |
12 | 3b0748b429 |
13 | 1ba5574446 |
14 | d9ccb4689 |
15 | 7d61e1423 |
hex | 4b5dff4a1 |
20231222433 has 8 divisors (see below), whose sum is σ = 27242042496. Its totient is φ = 13353942000.
The previous prime is 20231222423. The next prime is 20231222443. The reversal of 20231222433 is 33422213202.
It is an interprime number because it is at equal distance from previous prime (20231222423) and next prime (20231222443).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20231222433 - 218 = 20230960289 is a prime.
It is a super-3 number, since 3×202312224333 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (20231222413) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33384553 + ... + 33385158.
It is an arithmetic number, because the mean of its divisors is an integer number (3405255312).
Almost surely, 220231222433 is an apocalyptic number.
It is an amenable number.
20231222433 is a deficient number, since it is larger than the sum of its proper divisors (7010820063).
20231222433 is a wasteful number, since it uses less digits than its factorization.
20231222433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66769815.
The product of its (nonzero) digits is 3456, while the sum is 24.
Adding to 20231222433 its reverse (33422213202), we get a palindrome (53653435635).
The spelling of 20231222433 in words is "twenty billion, two hundred thirty-one million, two hundred twenty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •