Base | Representation |
---|---|
bin | 10011011000101100… |
… | …100101000111101110 |
3 | 1222201122220121201020 |
4 | 103120230211013232 |
5 | 320112222343342 |
6 | 13321254555010 |
7 | 1334553162102 |
oct | 233054450756 |
9 | 58648817636 |
10 | 20815434222 |
11 | 8911851900 |
12 | 404b068a66 |
13 | 1c696029ab |
14 | 101670b902 |
15 | 81c6410ec |
hex | 4d8b251ee |
20815434222 has 48 divisors (see below), whose sum is σ = 45891224400. Its totient is φ = 6289557120.
The previous prime is 20815434209. The next prime is 20815434223. The reversal of 20815434222 is 22243451802.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20815434223) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 212298 + ... + 294450.
It is an arithmetic number, because the mean of its divisors is an integer number (956067175).
Almost surely, 220815434222 is an apocalyptic number.
20815434222 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 20815434222, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22945612200).
20815434222 is an abundant number, since it is smaller than the sum of its proper divisors (25075790178).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20815434222 is a wasteful number, since it uses less digits than its factorization.
20815434222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82529 (or 82518 counting only the distinct ones).
The product of its (nonzero) digits is 30720, while the sum is 33.
The spelling of 20815434222 in words is "twenty billion, eight hundred fifteen million, four hundred thirty-four thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •