Base | Representation |
---|---|
bin | 11101100010100110000… |
… | …101110010101101110101 |
3 | 21012001210222000200201002 |
4 | 131202212011302231311 |
5 | 231224430320200041 |
6 | 4152324011013045 |
7 | 266443365434342 |
oct | 35424605625565 |
9 | 7161728020632 |
10 | 2030011100021 |
11 | 712a17386493 |
12 | 28951a73a185 |
13 | 119577014918 |
14 | 703785877c9 |
15 | 37c12a9a59b |
hex | 1d8a6172b75 |
2030011100021 has 4 divisors (see below), whose sum is σ = 2030014189632. Its totient is φ = 2030008010412.
The previous prime is 2030011099939. The next prime is 2030011100053. The reversal of 2030011100021 is 1200011100302.
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 2030011100021 - 226 = 2029943991157 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2030011099975 and 2030011100011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2030011106021) 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, 123101 + ... + 2018706.
It is an arithmetic number, because the mean of its divisors is an integer number (507503547408).
Almost surely, 22030011100021 is an apocalyptic number.
It is an amenable number.
2030011100021 is a deficient number, since it is larger than the sum of its proper divisors (3089611).
2030011100021 is an equidigital number, since it uses as much as digits as its factorization.
2030011100021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3089610.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 2030011100021 its reverse (1200011100302), we get a palindrome (3230022200323).
The spelling of 2030011100021 in words is "two trillion, thirty billion, eleven million, one hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •