Base | Representation |
---|---|
bin | 10010110101111011… |
… | …000010010000001001 |
3 | 1221020000010011020011 |
4 | 102311323002100021 |
5 | 312413344133001 |
6 | 13143334231521 |
7 | 1314240224653 |
oct | 226573022011 |
9 | 57200104204 |
10 | 20232021001 |
11 | 86424a2915 |
12 | 3b077b55a1 |
13 | 1ba5793a7a |
14 | d9d0416d3 |
15 | 7d62ecd51 |
hex | 4b5ec2409 |
20232021001 has 4 divisors (see below), whose sum is σ = 21111674112. Its totient is φ = 19352367892.
The previous prime is 20232020993. The next prime is 20232021037. The reversal of 20232021001 is 10012023202.
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, and also an emirpimes, since its reverse is a distinct semiprime: 10012023202 = 2 ⋅5006011601.
It is a cyclic number.
It is not a de Polignac number, because 20232021001 - 23 = 20232020993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20232021041) 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, 439826521 + ... + 439826566.
It is an arithmetic number, because the mean of its divisors is an integer number (5277918528).
Almost surely, 220232021001 is an apocalyptic number.
It is an amenable number.
20232021001 is a deficient number, since it is larger than the sum of its proper divisors (879653111).
20232021001 is an equidigital number, since it uses as much as digits as its factorization.
20232021001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 879653110.
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 20232021001 its reverse (10012023202), we get a palindrome (30244044203).
It can be divided in two parts, 2023202 and 1001, that multiplied together give a palindrome (2025225202).
The spelling of 20232021001 in words is "twenty billion, two hundred thirty-two million, twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •