Base | Representation |
---|---|
bin | 101111110111111011000000… |
… | …1101010110000001000110001 |
3 | 2001012222222111102021121212102 |
4 | 1133233312001222300020301 |
5 | 420143314343431120101 |
6 | 4051335411131310145 |
7 | 154461430111264541 |
oct | 13757660152601061 |
9 | 2035888442247772 |
10 | 421102244004401 |
11 | 1121a350569a413 |
12 | 3b2905295ab355 |
13 | 150c7a044a77bb |
14 | 75db658dc3321 |
15 | 33a3c8097586b |
hex | 17efd81ab0231 |
421102244004401 has 8 divisors (see below), whose sum is σ = 445923752980320. Its totient is φ = 396286378221888.
The previous prime is 421102244004397. The next prime is 421102244004437. The reversal of 421102244004401 is 104400442201124.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 421102244004401 - 22 = 421102244004397 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (421102244009401) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1410644711 + ... + 1410943196.
It is an arithmetic number, because the mean of its divisors is an integer number (55740469122540).
Almost surely, 2421102244004401 is an apocalyptic number.
It is an amenable number.
421102244004401 is a deficient number, since it is larger than the sum of its proper divisors (24821508975919).
421102244004401 is a wasteful number, since it uses less digits than its factorization.
421102244004401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2821596703.
The product of its (nonzero) digits is 8192, while the sum is 29.
Adding to 421102244004401 its reverse (104400442201124), we get a palindrome (525502686205525).
The spelling of 421102244004401 in words is "four hundred twenty-one trillion, one hundred two billion, two hundred forty-four million, four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •