Base | Representation |
---|---|
bin | 10100111001001110… |
… | …111011111111011011 |
3 | 2010220112111210201120 |
4 | 110321032323333123 |
5 | 331421333203111 |
6 | 14150113020323 |
7 | 1422650544222 |
oct | 247116737733 |
9 | 63815453646 |
10 | 22435053531 |
11 | 9573003860 |
12 | 44215546a3 |
13 | 2167017807 |
14 | 112b86bcb9 |
15 | 8b4918406 |
hex | 5393bbfdb |
22435053531 has 8 divisors (see below), whose sum is σ = 32632805184. Its totient is φ = 13597002120.
The previous prime is 22435053503. The next prime is 22435053569. The reversal of 22435053531 is 13535053422.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22435053531 - 214 = 22435037147 is a prime.
It is a super-2 number, since 2×224350535312 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 679850107 = 22435053531 / (2 + 2 + 4 + 3 + 5 + 0 + 5 + 3 + 5 + 3 + 1).
It is a junction number, because it is equal to n+sod(n) for n = 22435053492 and 22435053501.
It is not an unprimeable number, because it can be changed into a prime (22435053031) 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, 339925021 + ... + 339925086.
It is an arithmetic number, because the mean of its divisors is an integer number (4079100648).
Almost surely, 222435053531 is an apocalyptic number.
22435053531 is a deficient number, since it is larger than the sum of its proper divisors (10197751653).
22435053531 is a wasteful number, since it uses less digits than its factorization.
22435053531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 679850121.
The product of its (nonzero) digits is 54000, while the sum is 33.
The spelling of 22435053531 in words is "twenty-two billion, four hundred thirty-five million, fifty-three thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •