Base | Representation |
---|---|
bin | 101111111001100001011010… |
… | …0100100010111100111110010 |
3 | 2001020210000002102211201100120 |
4 | 1133303002310210113213302 |
5 | 420210420221133114414 |
6 | 4052024415241431110 |
7 | 154513343266414365 |
oct | 13763026444274762 |
9 | 2036700072751316 |
10 | 421322141301234 |
11 | 112278797a12188 |
12 | 3b30707879b496 |
13 | 15112679b225a4 |
14 | 76081598940dc |
15 | 33a9850b2a2a9 |
hex | 17f30b49179f2 |
421322141301234 has 8 divisors (see below), whose sum is σ = 842644282602480. Its totient is φ = 140440713767076.
The previous prime is 421322141301223. The next prime is 421322141301251. The reversal of 421322141301234 is 432103141223124.
It is a sphenic number, since it is the product of 3 distinct primes.
421322141301234 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 421322141301195 and 421322141301204.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35110178441764 + ... + 35110178441775.
It is an arithmetic number, because the mean of its divisors is an integer number (105330535325310).
Almost surely, 2421322141301234 is an apocalyptic number.
421322141301234 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
421322141301234 is a wasteful number, since it uses less digits than its factorization.
421322141301234 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70220356883544.
The product of its (nonzero) digits is 27648, while the sum is 33.
Adding to 421322141301234 its reverse (432103141223124), we get a palindrome (853425282524358).
The spelling of 421322141301234 in words is "four hundred twenty-one trillion, three hundred twenty-two billion, one hundred forty-one million, three hundred one thousand, two hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •