Base | Representation |
---|---|
bin | 10111110111011110010… |
… | …01100100100110110101 |
3 | 2220101201010010122112001 |
4 | 23323233021210212311 |
5 | 101413433322100401 |
6 | 1424421211055301 |
7 | 113150516262211 |
oct | 13735711444665 |
9 | 2811633118461 |
10 | 820056050101 |
11 | 296869297012 |
12 | 112b23141531 |
13 | 5c43c14a442 |
14 | 2b995c7b941 |
15 | 164e8e30601 |
hex | beef2649b5 |
820056050101 has 4 divisors (see below), whose sum is σ = 846509471104. Its totient is φ = 793602629100.
The previous prime is 820056050089. The next prime is 820056050141. The reversal of 820056050101 is 101050650028.
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 820056050101 - 223 = 820047661493 is a prime.
It is a super-2 number, since 2×8200560501012 (a number of 25 digits) contains 22 as substring.
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 820056050101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (820056050141) 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, 13226710455 + ... + 13226710516.
It is an arithmetic number, because the mean of its divisors is an integer number (211627367776).
Almost surely, 2820056050101 is an apocalyptic number.
It is an amenable number.
820056050101 is a deficient number, since it is larger than the sum of its proper divisors (26453421003).
820056050101 is a wasteful number, since it uses less digits than its factorization.
820056050101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26453421002.
The product of its (nonzero) digits is 2400, while the sum is 28.
The spelling of 820056050101 in words is "eight hundred twenty billion, fifty-six million, fifty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •