Base | Representation |
---|---|
bin | 111100100101101… |
… | …1111100100000001 |
3 | 12020200112221112102 |
4 | 1321023133210001 |
5 | 13130430243001 |
6 | 533423240145 |
7 | 101244455654 |
oct | 17113374401 |
9 | 5220487472 |
10 | 2033056001 |
11 | 953675079 |
12 | 488a49055 |
13 | 26527c322 |
14 | 15402189b |
15 | bd741e6b |
hex | 792df901 |
2033056001 has 4 divisors (see below), whose sum is σ = 2040614100. Its totient is φ = 2025497904.
The previous prime is 2033055949. The next prime is 2033056019. The reversal of 2033056001 is 1006503302.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 46036225 + 1987019776 = 6785^2 + 44576^2 .
It is a cyclic number.
It is not a de Polignac number, because 2033056001 - 218 = 2032793857 is a prime.
It is a super-2 number, since 2×20330560012 = 8266633406404224002, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2033056021) 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, 3778646 + ... + 3779183.
It is an arithmetic number, because the mean of its divisors is an integer number (510153525).
Almost surely, 22033056001 is an apocalyptic number.
It is an amenable number.
2033056001 is a deficient number, since it is larger than the sum of its proper divisors (7558099).
2033056001 is an equidigital number, since it uses as much as digits as its factorization.
2033056001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7558098.
The product of its (nonzero) digits is 540, while the sum is 20.
The square root of 2033056001 is about 45089.4222739658. The cubic root of 2033056001 is about 1266.8244803911.
Adding to 2033056001 its reverse (1006503302), we get a palindrome (3039559303).
The spelling of 2033056001 in words is "two billion, thirty-three million, fifty-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •