Base | Representation |
---|---|
bin | 10010101001111000… |
… | …111000011101110001 |
3 | 1220200221020000212220 |
4 | 102221320320131301 |
5 | 312010203130113 |
6 | 13111323111253 |
7 | 1306236203364 |
oct | 225170703561 |
9 | 56627200786 |
10 | 20030130033 |
11 | 8549539181 |
12 | 3a70072529 |
13 | 1b729c6b64 |
14 | d802ca0db |
15 | 7c371d523 |
hex | 4a9e38771 |
20030130033 has 4 divisors (see below), whose sum is σ = 26706840048. Its totient is φ = 13353420020.
The previous prime is 20030130023. The next prime is 20030130059. The reversal of 20030130033 is 33003103002.
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 20030130033 - 24 = 20030130017 is a prime.
It is a super-2 number, since 2×200301300332 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20030129994 and 20030130021.
It is not an unprimeable number, because it can be changed into a prime (20030130023) 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, 3338355003 + ... + 3338355008.
It is an arithmetic number, because the mean of its divisors is an integer number (6676710012).
Almost surely, 220030130033 is an apocalyptic number.
It is an amenable number.
20030130033 is a deficient number, since it is larger than the sum of its proper divisors (6676710015).
20030130033 is an equidigital number, since it uses as much as digits as its factorization.
20030130033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6676710014.
The product of its (nonzero) digits is 162, while the sum is 15.
Adding to 20030130033 its reverse (33003103002), we get a palindrome (53033233035).
The spelling of 20030130033 in words is "twenty billion, thirty million, one hundred thirty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •