Base | Representation |
---|---|
bin | 111101011111010… |
… | …1111100100111101 |
3 | 12022210101212211011 |
4 | 1322332233210331 |
5 | 13211144040112 |
6 | 540422555221 |
7 | 102062330026 |
oct | 17276574475 |
9 | 5283355734 |
10 | 2063268157 |
11 | 96972a9a5 |
12 | 496b98b11 |
13 | 26b5c9a42 |
14 | 158047c4d |
15 | c120daa7 |
hex | 7afaf93d |
2063268157 has 4 divisors (see below), whose sum is σ = 2063507616. Its totient is φ = 2063028700.
The previous prime is 2063268139. The next prime is 2063268169. The reversal of 2063268157 is 7518623602.
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 2063268157 - 211 = 2063266109 is a prime.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2063268127) 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, 106303 + ... + 124204.
It is an arithmetic number, because the mean of its divisors is an integer number (515876904).
Almost surely, 22063268157 is an apocalyptic number.
It is an amenable number.
2063268157 is a deficient number, since it is larger than the sum of its proper divisors (239459).
2063268157 is an equidigital number, since it uses as much as digits as its factorization.
2063268157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 239458.
The product of its (nonzero) digits is 120960, while the sum is 40.
The square root of 2063268157 is about 45423.2116543954. The cubic root of 2063268157 is about 1273.0688503355.
The spelling of 2063268157 in words is "two billion, sixty-three million, two hundred sixty-eight thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •