Base | Representation |
---|---|
bin | 111100001101001… |
… | …0010000000101011 |
3 | 12012210021112021200 |
4 | 1320122102000223 |
5 | 13114124433220 |
6 | 532242535243 |
7 | 101030015664 |
oct | 17032220053 |
9 | 5183245250 |
10 | 2020155435 |
11 | 947363751 |
12 | 484667523 |
13 | 2626b345c |
14 | 15242436b |
15 | bc544890 |
hex | 7869202b |
2020155435 has 48 divisors (see below), whose sum is σ = 3669966144. Its totient is φ = 1026026496.
The previous prime is 2020155433. The next prime is 2020155443. The reversal of 2020155435 is 5345510202.
It is a happy number.
2020155435 is a `hidden beast` number, since 20 + 201 + 5 + 5 + 435 = 666.
It is not a de Polignac number, because 2020155435 - 21 = 2020155433 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2020155399 and 2020155408.
It is not an unprimeable number, because it can be changed into a prime (2020155433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 236967 + ... + 245343.
It is an arithmetic number, because the mean of its divisors is an integer number (76457628).
Almost surely, 22020155435 is an apocalyptic number.
2020155435 is a deficient number, since it is larger than the sum of its proper divisors (1649810709).
2020155435 is a wasteful number, since it uses less digits than its factorization.
2020155435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8644 (or 8641 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 27.
The square root of 2020155435 is about 44946.1392669048. The cubic root of 2020155435 is about 1264.1392875384.
Adding to 2020155435 its reverse (5345510202), we get a palindrome (7365665637).
The spelling of 2020155435 in words is "two billion, twenty million, one hundred fifty-five thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •