Base | Representation |
---|---|
bin | 111100001101101… |
… | …0001011011110111 |
3 | 12012210202201122110 |
4 | 1320123101123313 |
5 | 13114211241343 |
6 | 532252302103 |
7 | 101032150251 |
oct | 17033213367 |
9 | 5183681573 |
10 | 2020415223 |
11 | 947520952 |
12 | 484771933 |
13 | 262774788 |
14 | 152490cd1 |
15 | bc596833 |
hex | 786d16f7 |
2020415223 has 4 divisors (see below), whose sum is σ = 2693886968. Its totient is φ = 1346943480.
The previous prime is 2020415209. The next prime is 2020415249. The reversal of 2020415223 is 3225140202.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 2020415223 - 25 = 2020415191 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 2020415223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2020415203) 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 3 ways as a sum of consecutive naturals, for example, 336735868 + ... + 336735873.
It is an arithmetic number, because the mean of its divisors is an integer number (673471742).
Almost surely, 22020415223 is an apocalyptic number.
2020415223 is a deficient number, since it is larger than the sum of its proper divisors (673471745).
2020415223 is an equidigital number, since it uses as much as digits as its factorization.
2020415223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 673471744.
The product of its (nonzero) digits is 960, while the sum is 21.
The square root of 2020415223 is about 44949.0291663791. The cubic root of 2020415223 is about 1264.1934738211.
Adding to 2020415223 its reverse (3225140202), we get a palindrome (5245555425).
The spelling of 2020415223 in words is "two billion, twenty million, four hundred fifteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •