Base | Representation |
---|---|
bin | 10100110010111111… |
… | …011011010111010001 |
3 | 2010122020110000102002 |
4 | 110302333123113101 |
5 | 331213030340213 |
6 | 14131452203345 |
7 | 1420236424454 |
oct | 246277332721 |
9 | 63566400362 |
10 | 22330324433 |
11 | 951998228a |
12 | 43b2469555 |
13 | 214b409631 |
14 | 111b9a949b |
15 | 8aa62c658 |
hex | 532fdb5d1 |
22330324433 has 8 divisors (see below), whose sum is σ = 23337237888. Its totient is φ = 21326413504.
The previous prime is 22330324409. The next prime is 22330324439. The reversal of 22330324433 is 33442303322.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22330324433 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 22330324396 and 22330324405.
It is not an unprimeable number, because it can be changed into a prime (22330324439) 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, 735416 + ... + 765177.
It is an arithmetic number, because the mean of its divisors is an integer number (2917154736).
Almost surely, 222330324433 is an apocalyptic number.
22330324433 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
22330324433 is a deficient number, since it is larger than the sum of its proper divisors (1006913455).
22330324433 is a wasteful number, since it uses less digits than its factorization.
22330324433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1501263.
The product of its (nonzero) digits is 31104, while the sum is 29.
Adding to 22330324433 its reverse (33442303322), we get a palindrome (55772627755).
The spelling of 22330324433 in words is "twenty-two billion, three hundred thirty million, three hundred twenty-four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •