Base | Representation |
---|---|
bin | 1100010000111110101… |
… | …00110000100011000001 |
3 | 1111021210100021120012212 |
4 | 12020133110300203001 |
5 | 23401043134033213 |
6 | 521334153231505 |
7 | 42306325463252 |
oct | 6103724604301 |
9 | 1437710246185 |
10 | 421432330433 |
11 | 152801622484 |
12 | 69814a02595 |
13 | 309829a437a |
14 | 1657c7b4b29 |
15 | ae682939a8 |
hex | 621f5308c1 |
421432330433 has 4 divisors (see below), whose sum is σ = 421868145600. Its totient is φ = 420996515268.
The previous prime is 421432330409. The next prime is 421432330471. The reversal of 421432330433 is 334033234124.
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.
It is a cyclic number.
It is not a de Polignac number, because 421432330433 - 218 = 421432068289 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 421432330433.
It is not an unprimeable number, because it can be changed into a prime (421432330493) 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, 217906133 + ... + 217908066.
It is an arithmetic number, because the mean of its divisors is an integer number (105467036400).
Almost surely, 2421432330433 is an apocalyptic number.
It is an amenable number.
421432330433 is a deficient number, since it is larger than the sum of its proper divisors (435815167).
421432330433 is an equidigital number, since it uses as much as digits as its factorization.
421432330433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 435815166.
The product of its (nonzero) digits is 62208, while the sum is 32.
Adding to 421432330433 its reverse (334033234124), we get a palindrome (755465564557).
The spelling of 421432330433 in words is "four hundred twenty-one billion, four hundred thirty-two million, three hundred thirty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •