Base | Representation |
---|---|
bin | 1100010000110001110… |
… | …00010110011001110111 |
3 | 1111021111210211222121121 |
4 | 12020120320112121313 |
5 | 23400333000020043 |
6 | 521315332124411 |
7 | 42303543531460 |
oct | 6103070263167 |
9 | 1437453758547 |
10 | 421324220023 |
11 | 1527565a1533 |
12 | 697a4766707 |
13 | 30966481105 |
14 | 1656c2b1d67 |
15 | ae5da3aded |
hex | 6218e16677 |
421324220023 has 4 divisors (see below), whose sum is σ = 481513394320. Its totient is φ = 361135045728.
The previous prime is 421324220003. The next prime is 421324220039. The reversal of 421324220023 is 320022423124.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 421324220023 - 213 = 421324211831 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 421324220023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (421324220003) 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 3 ways as a sum of consecutive naturals, for example, 30094587138 + ... + 30094587151.
It is an arithmetic number, because the mean of its divisors is an integer number (120378348580).
Almost surely, 2421324220023 is an apocalyptic number.
421324220023 is a deficient number, since it is larger than the sum of its proper divisors (60189174297).
421324220023 is an equidigital number, since it uses as much as digits as its factorization.
421324220023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60189174296.
The product of its (nonzero) digits is 4608, while the sum is 25.
Adding to 421324220023 its reverse (320022423124), we get a palindrome (741346643147).
The spelling of 421324220023 in words is "four hundred twenty-one billion, three hundred twenty-four million, two hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •