Base | Representation |
---|---|
bin | 10010000110100110011… |
… | …10001011011011101011 |
3 | 2012110112120111011010100 |
4 | 21003103032023123223 |
5 | 40142343331000133 |
6 | 1153430201520443 |
7 | 62640132156300 |
oct | 11032316133353 |
9 | 2173476434110 |
10 | 622019000043 |
11 | 21a8845671a1 |
12 | a0674aa3123 |
13 | 4686b70270c |
14 | 2216a76d0a7 |
15 | 112a7ea0e13 |
hex | 90d338b6eb |
622019000043 has 72 divisors (see below), whose sum is σ = 1071105955920. Its totient is φ = 346623459840.
The previous prime is 622019000039. The next prime is 622019000093. The reversal of 622019000043 is 340000910226.
It is not a de Polignac number, because 622019000043 - 22 = 622019000039 is a prime.
It is a super-3 number, since 3×6220190000433 (a number of 36 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 622018999980 and 622019000016.
It is not an unprimeable number, because it can be changed into a prime (622019000003) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 53676696 + ... + 53688282.
It is an arithmetic number, because the mean of its divisors is an integer number (14876471610).
Almost surely, 2622019000043 is an apocalyptic number.
622019000043 is a gapful number since it is divisible by the number (63) formed by its first and last digit.
622019000043 is a deficient number, since it is larger than the sum of its proper divisors (449086955877).
622019000043 is a wasteful number, since it uses less digits than its factorization.
622019000043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14617 (or 14607 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 622019000043 its reverse (340000910226), we get a palindrome (962019910269).
The spelling of 622019000043 in words is "six hundred twenty-two billion, nineteen million, forty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •