Base | Representation |
---|---|
bin | 1001001100110001111011… |
… | …01001011000000111001001 |
3 | 2122122000000111102001120201 |
4 | 10212120331221120013021 |
5 | 10122423204014033001 |
6 | 111005404014052201 |
7 | 4155410304423115 |
oct | 446307551300711 |
9 | 78560014361521 |
10 | 20230330221001 |
11 | 649a6a900818a |
12 | 23289347aa061 |
13 | b39934217534 |
14 | 4dd220586745 |
15 | 251385e12501 |
hex | 12663da581c9 |
20230330221001 has 2 divisors, whose sum is σ = 20230330221002. Its totient is φ = 20230330221000.
The previous prime is 20230330220959. The next prime is 20230330221007. The reversal of 20230330221001 is 10012203303202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16535804147776 + 3694526073225 = 4066424^2 + 1922115^2 .
It is a cyclic number.
It is not a de Polignac number, because 20230330221001 - 213 = 20230330212809 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20230330221001.
It is not a weakly prime, because it can be changed into another prime (20230330221007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10115165110500 + 10115165110501.
It is an arithmetic number, because the mean of its divisors is an integer number (10115165110501).
Almost surely, 220230330221001 is an apocalyptic number.
It is an amenable number.
20230330221001 is a deficient number, since it is larger than the sum of its proper divisors (1).
20230330221001 is an equidigital number, since it uses as much as digits as its factorization.
20230330221001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 20230330221001 its reverse (10012203303202), we get a palindrome (30242533524203).
The spelling of 20230330221001 in words is "twenty trillion, two hundred thirty billion, three hundred thirty million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •