Base | Representation |
---|---|
bin | 111100001101000… |
… | …1100001001111111 |
3 | 12012210020022101112 |
4 | 1320122030021333 |
5 | 13114123201310 |
6 | 532242232235 |
7 | 101026556036 |
oct | 17032141177 |
9 | 5183208345 |
10 | 2020131455 |
11 | 947347731 |
12 | 48465567b |
13 | 2626a5574 |
14 | 15241971d |
15 | bc53c705 |
hex | 7868c27f |
2020131455 has 4 divisors (see below), whose sum is σ = 2424157752. Its totient is φ = 1616105160.
The previous prime is 2020131391. The next prime is 2020131457. The reversal of 2020131455 is 5541310202.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 2020131455 - 26 = 2020131391 is a prime.
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 2020131455.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2020131457) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 202013141 + ... + 202013150.
It is an arithmetic number, because the mean of its divisors is an integer number (606039438).
Almost surely, 22020131455 is an apocalyptic number.
2020131455 is a deficient number, since it is larger than the sum of its proper divisors (404026297).
2020131455 is an equidigital number, since it uses as much as digits as its factorization.
2020131455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 404026296.
The product of its (nonzero) digits is 1200, while the sum is 23.
The square root of 2020131455 is about 44945.8725023778. The cubic root of 2020131455 is about 1264.1342855833.
Adding to 2020131455 its reverse (5541310202), we get a palindrome (7561441657).
The spelling of 2020131455 in words is "two billion, twenty million, one hundred thirty-one thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •