Base | Representation |
---|---|
bin | 1100010000001101101… |
… | …01010110001110111001 |
3 | 1111020201201010022121211 |
4 | 12020012311112032321 |
5 | 23344222442134001 |
6 | 521225314403121 |
7 | 42263206134565 |
oct | 6100665261671 |
9 | 1436651108554 |
10 | 421021443001 |
11 | 1526106a0695 |
12 | 6971b2904a1 |
13 | 30918820303 |
14 | 1653ddb86a5 |
15 | ae4217e351 |
hex | 6206d563b9 |
421021443001 has 6 divisors (see below), whose sum is σ = 435040888506. Its totient is φ = 407440105200.
The previous prime is 421021442993. The next prime is 421021443019. The reversal of 421021443001 is 100344120124.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 277892394025 + 143129048976 = 527155^2 + 378324^2 .
It is not a de Polignac number, because 421021443001 - 23 = 421021442993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (421021443091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 219052860 + ... + 219054781.
It is an arithmetic number, because the mean of its divisors is an integer number (72506814751).
Almost surely, 2421021443001 is an apocalyptic number.
It is an amenable number.
421021443001 is a deficient number, since it is larger than the sum of its proper divisors (14019445505).
421021443001 is an equidigital number, since it uses as much as digits as its factorization.
421021443001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 438107703 (or 438107672 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 421021443001 its reverse (100344120124), we get a palindrome (521365563125).
The spelling of 421021443001 in words is "four hundred twenty-one billion, twenty-one million, four hundred forty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •