Base | Representation |
---|---|
bin | 11000110100001001… |
… | …00010101001110110 |
3 | 1021101110020221222100 |
4 | 30122010202221312 |
5 | 204241002100042 |
6 | 10041543042530 |
7 | 651065452563 |
oct | 143204425166 |
9 | 37343227870 |
10 | 13322300022 |
11 | 5717100209 |
12 | 26b9740446 |
13 | 13440a9a85 |
14 | 9054a586a |
15 | 52e8b824c |
hex | 31a122a76 |
13322300022 has 12 divisors (see below), whose sum is σ = 28864983420. Its totient is φ = 4440766668.
The previous prime is 13322299997. The next prime is 13322300023. The reversal of 13322300022 is 22000322331.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 740127779 = 13322300022 / (1 + 3 + 3 + 2 + 2 + 3 + 0 + 0 + 0 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 13322299968 and 13322300004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13322300023) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 370063872 + ... + 370063907.
It is an arithmetic number, because the mean of its divisors is an integer number (2405415285).
Almost surely, 213322300022 is an apocalyptic number.
13322300022 is an abundant number, since it is smaller than the sum of its proper divisors (15542683398).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13322300022 is a wasteful number, since it uses less digits than its factorization.
13322300022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 740127787 (or 740127784 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 13322300022 its reverse (22000322331), we get a palindrome (35322622353).
The spelling of 13322300022 in words is "thirteen billion, three hundred twenty-two million, three hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •