Base | Representation |
---|---|
bin | 10010110101011101… |
… | …101111101111011011 |
3 | 1221012110200001222212 |
4 | 102311131233233123 |
5 | 312404412434003 |
6 | 13142501505335 |
7 | 1314115036064 |
oct | 226535575733 |
9 | 57173601885 |
10 | 20224343003 |
11 | 8639129267 |
12 | 3b0511224b |
13 | 1ba4006087 |
14 | d9c00356b |
15 | 7d57d2dd8 |
hex | 4b576fbdb |
20224343003 has 8 divisors (see below), whose sum is σ = 21132470688. Its totient is φ = 19318616064.
The previous prime is 20224342997. The next prime is 20224343017. The reversal of 20224343003 is 30034342202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20224343003 - 210 = 20224341979 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20224343003.
It is not an unprimeable number, because it can be changed into a prime (20224343023) 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, 582950 + ... + 616667.
It is an arithmetic number, because the mean of its divisors is an integer number (2641558836).
Almost surely, 220224343003 is an apocalyptic number.
20224343003 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
20224343003 is a deficient number, since it is larger than the sum of its proper divisors (908127685).
20224343003 is a wasteful number, since it uses less digits than its factorization.
20224343003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1200373.
The product of its (nonzero) digits is 3456, while the sum is 23.
Adding to 20224343003 its reverse (30034342202), we get a palindrome (50258685205).
The spelling of 20224343003 in words is "twenty billion, two hundred twenty-four million, three hundred forty-three thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •