Base | Representation |
---|---|
bin | 11101010000111010111… |
… | …011101010011001010010 |
3 | 21010020211101011022111111 |
4 | 131100322323222121102 |
5 | 230422044023210302 |
6 | 4135504521203534 |
7 | 265202165653342 |
oct | 35207273523122 |
9 | 7106741138444 |
10 | 2011033413202 |
11 | 705968a304a0 |
12 | 2859030305aa |
13 | 11784138a438 |
14 | 6d497d7ad22 |
15 | 374a196c0d7 |
hex | 1d43aeea652 |
2011033413202 has 8 divisors (see below), whose sum is σ = 3290781948912. Its totient is φ = 914106096900.
The previous prime is 2011033413187. The next prime is 2011033413209. The reversal of 2011033413202 is 2023143301102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 91410609691 = 2011033413202 / (2 + 0 + 1 + 1 + 0 + 3 + 3 + 4 + 1 + 3 + 2 + 0 + 2).
It is not an unprimeable number, because it can be changed into a prime (2011033413209) 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, 45705304824 + ... + 45705304867.
It is an arithmetic number, because the mean of its divisors is an integer number (411347743614).
Almost surely, 22011033413202 is an apocalyptic number.
2011033413202 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2011033413202 is a deficient number, since it is larger than the sum of its proper divisors (1279748535710).
2011033413202 is a wasteful number, since it uses less digits than its factorization.
2011033413202 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 91410609704.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 2011033413202 its reverse (2023143301102), we get a palindrome (4034176714304).
The spelling of 2011033413202 in words is "two trillion, eleven billion, thirty-three million, four hundred thirteen thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •