Base | Representation |
---|---|
bin | 111010100000011110101… |
… | …111000100011000011101 |
3 | 112020100212212201101212022 |
4 | 322200132233010120131 |
5 | 1011333144342404003 |
6 | 12315012423345525 |
7 | 563323224665330 |
oct | 72403657043035 |
9 | 15210785641768 |
10 | 4020605044253 |
11 | 1310146804366 |
12 | 54b2785b22a5 |
13 | 2321ab946c05 |
14 | dc853b22617 |
15 | 6e8b9ddd738 |
hex | 3a81ebc461d |
4020605044253 has 4 divisors (see below), whose sum is σ = 4594977193440. Its totient is φ = 3446232895068.
The previous prime is 4020605044231. The next prime is 4020605044259. The reversal of 4020605044253 is 3524405060204.
4020605044253 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4020605044253 - 222 = 4020600849949 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4020605044259) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 287186074583 + ... + 287186074596.
It is an arithmetic number, because the mean of its divisors is an integer number (1148744298360).
Almost surely, 24020605044253 is an apocalyptic number.
It is an amenable number.
4020605044253 is a deficient number, since it is larger than the sum of its proper divisors (574372149187).
4020605044253 is an equidigital number, since it uses as much as digits as its factorization.
4020605044253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 574372149186.
The product of its (nonzero) digits is 115200, while the sum is 35.
The spelling of 4020605044253 in words is "four trillion, twenty billion, six hundred five million, forty-four thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •