Base | Representation |
---|---|
bin | 11101011010010011100… |
… | …010111001111100110101 |
3 | 21011012211122002111021222 |
4 | 131122103202321330311 |
5 | 231103213131431013 |
6 | 4144252442120125 |
7 | 266006663541305 |
oct | 35322342717465 |
9 | 7135748074258 |
10 | 2021110030133 |
11 | 70a169a15987 |
12 | 2878557b0045 |
13 | 118788bc216c |
14 | 6db72365605 |
15 | 37891411508 |
hex | 1d6938b9f35 |
2021110030133 has 4 divisors (see below), whose sum is σ = 2075734625580. Its totient is φ = 1966485434688.
The previous prime is 2021110030103. The next prime is 2021110030139. The reversal of 2021110030133 is 3310300111202.
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 764753748004 + 1256356282129 = 874502^2 + 1120873^2 .
It is a cyclic number.
It is not a de Polignac number, because 2021110030133 - 224 = 2021093252917 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 (2021110030139) 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, 27312297668 + ... + 27312297741.
It is an arithmetic number, because the mean of its divisors is an integer number (518933656395).
Almost surely, 22021110030133 is an apocalyptic number.
It is an amenable number.
2021110030133 is a deficient number, since it is larger than the sum of its proper divisors (54624595447).
2021110030133 is an equidigital number, since it uses as much as digits as its factorization.
2021110030133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54624595446.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 2021110030133 its reverse (3310300111202), we get a palindrome (5331410141335).
The spelling of 2021110030133 in words is "two trillion, twenty-one billion, one hundred ten million, thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •