Base | Representation |
---|---|
bin | 110001110011011000010… |
… | …111100010001011001011 |
3 | 110010011212121120122220212 |
4 | 301303120113202023023 |
5 | 422033111021444223 |
6 | 11140123452111335 |
7 | 502155600100550 |
oct | 61633027421313 |
9 | 13104777518825 |
10 | 3422424015563 |
11 | 10aa495152943 |
12 | 473356a6554b |
13 | 1ba96babc8b7 |
14 | bb909292a27 |
15 | 5e059ac5278 |
hex | 31cd85e22cb |
3422424015563 has 32 divisors (see below), whose sum is σ = 4149773752320. Its totient is φ = 2755383552000.
The previous prime is 3422424015503. The next prime is 3422424015601. The reversal of 3422424015563 is 3655104242243.
3422424015563 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 3422424015563 - 212 = 3422424011467 is a prime.
It is a super-2 number, since 2×34224240155632 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 3422424015563.
It is not an unprimeable number, because it can be changed into a prime (3422424015503) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 138777728 + ... + 138802386.
It is an arithmetic number, because the mean of its divisors is an integer number (129680429760).
Almost surely, 23422424015563 is an apocalyptic number.
3422424015563 is a deficient number, since it is larger than the sum of its proper divisors (727349736757).
3422424015563 is a wasteful number, since it uses less digits than its factorization.
3422424015563 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26987.
The product of its (nonzero) digits is 691200, while the sum is 41.
The spelling of 3422424015563 in words is "three trillion, four hundred twenty-two billion, four hundred twenty-four million, fifteen thousand, five hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •