Base | Representation |
---|---|
bin | 100111011010011110… |
… | …000010000011101111 |
3 | 11001020100120022222110 |
4 | 213122132002003233 |
5 | 1143132410332003 |
6 | 31235212415103 |
7 | 3025505106510 |
oct | 473236020357 |
9 | 131210508873 |
10 | 42320011503 |
11 | 16a475a8020 |
12 | 8250a77493 |
13 | 3cb5913133 |
14 | 2096768a07 |
15 | 117a50ca03 |
hex | 9da7820ef |
42320011503 has 32 divisors (see below), whose sum is σ = 70714732032. Its totient is φ = 21870489600.
The previous prime is 42320011439. The next prime is 42320011507. The reversal of 42320011503 is 30511002324.
It is not a de Polignac number, because 42320011503 - 26 = 42320011439 is a prime.
It is a super-2 number, since 2×423200115032 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 42320011503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42320011507) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 430038 + ... + 519203.
It is an arithmetic number, because the mean of its divisors is an integer number (2209835376).
Almost surely, 242320011503 is an apocalyptic number.
42320011503 is a deficient number, since it is larger than the sum of its proper divisors (28394720529).
42320011503 is a wasteful number, since it uses less digits than its factorization.
42320011503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 949455.
The product of its (nonzero) digits is 720, while the sum is 21.
Adding to 42320011503 its reverse (30511002324), we get a palindrome (72831013827).
The spelling of 42320011503 in words is "forty-two billion, three hundred twenty million, eleven thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •