Base | Representation |
---|---|
bin | 10010110000000010… |
… | …100001100101000101 |
3 | 1220222010101200022122 |
4 | 102300002201211011 |
5 | 312213112233104 |
6 | 13125450535325 |
7 | 1311631255643 |
oct | 226002414505 |
9 | 56863350278 |
10 | 20133321029 |
11 | 85a180a098 |
12 | 3a9a737545 |
13 | 1b8b1b6c13 |
14 | d8dcac193 |
15 | 7cc8036be |
hex | 4b00a1945 |
20133321029 has 4 divisors (see below), whose sum is σ = 20135981580. Its totient is φ = 20130660480.
The previous prime is 20133320989. The next prime is 20133321031. The reversal of 20133321029 is 92012333102.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 92012333102 = 2 ⋅46006166551.
It can be written as a sum of positive squares in 2 ways, for example, as 9119868004 + 11013453025 = 95498^2 + 104945^2 .
It is a cyclic number.
It is not a de Polignac number, because 20133321029 - 28 = 20133320773 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20133320989 and 20133321007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20133321059) 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, 1318892 + ... + 1334069.
It is an arithmetic number, because the mean of its divisors is an integer number (5033995395).
Almost surely, 220133321029 is an apocalyptic number.
It is an amenable number.
20133321029 is a deficient number, since it is larger than the sum of its proper divisors (2660551).
20133321029 is an equidigital number, since it uses as much as digits as its factorization.
20133321029 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2660550.
The product of its (nonzero) digits is 1944, while the sum is 26.
The spelling of 20133321029 in words is "twenty billion, one hundred thirty-three million, three hundred twenty-one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •