Base | Representation |
---|---|
bin | 10010110110100110… |
… | …100100101010001001 |
3 | 1221020210121000002022 |
4 | 102312212210222021 |
5 | 312424304342441 |
6 | 13144423014225 |
7 | 1314436231241 |
oct | 226646445211 |
9 | 57223530068 |
10 | 20243434121 |
11 | 8648988749 |
12 | 3b0b59a375 |
13 | 1ba7c5b8b1 |
14 | da0772b21 |
15 | 7d730484b |
hex | 4b69a4a89 |
20243434121 has 4 divisors (see below), whose sum is σ = 20243736852. Its totient is φ = 20243131392.
The previous prime is 20243434103. The next prime is 20243434129. The reversal of 20243434121 is 12143434202.
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 1900524025 + 18342910096 = 43595^2 + 135436^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20243434121 is a prime.
It is a super-2 number, since 2×202434341212 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (20243434129) 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, 1796 + ... + 201221.
It is an arithmetic number, because the mean of its divisors is an integer number (5060934213).
Almost surely, 220243434121 is an apocalyptic number.
It is an amenable number.
20243434121 is a deficient number, since it is larger than the sum of its proper divisors (302731).
20243434121 is an equidigital number, since it uses as much as digits as its factorization.
20243434121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 302730.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 20243434121 its reverse (12143434202), we get a palindrome (32386868323).
The spelling of 20243434121 in words is "twenty billion, two hundred forty-three million, four hundred thirty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •