Base | Representation |
---|---|
bin | 10100110111010101… |
… | …011110011111110101 |
3 | 2010211022121011010210 |
4 | 110313111132133311 |
5 | 331340210311201 |
6 | 14143014340033 |
7 | 1422113112450 |
oct | 246725363765 |
9 | 63738534123 |
10 | 22403213301 |
11 | 9557036817 |
12 | 441295a619 |
13 | 216054a041 |
14 | 1127540497 |
15 | 8b1c291d6 |
hex | 53755e7f5 |
22403213301 has 16 divisors (see below), whose sum is σ = 34364315648. Its totient is φ = 12717054000.
The previous prime is 22403213263. The next prime is 22403213353. The reversal of 22403213301 is 10331230422.
It is not a de Polignac number, because 22403213301 - 226 = 22336104437 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22403213381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3529345 + ... + 3535686.
It is an arithmetic number, because the mean of its divisors is an integer number (2147769728).
Almost surely, 222403213301 is an apocalyptic number.
22403213301 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
22403213301 is a deficient number, since it is larger than the sum of its proper divisors (11961102347).
22403213301 is a wasteful number, since it uses less digits than its factorization.
22403213301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7065192.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 22403213301 its reverse (10331230422), we get a palindrome (32734443723).
The spelling of 22403213301 in words is "twenty-two billion, four hundred three million, two hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •