Base | Representation |
---|---|
bin | 1100010000001110111… |
… | …10100011000010000011 |
3 | 1111020202110110000220001 |
4 | 12020013132203002003 |
5 | 23344233223241311 |
6 | 521230342100431 |
7 | 42263400006460 |
oct | 6100736430203 |
9 | 1436673400801 |
10 | 421032243331 |
11 | 1526167a8087 |
12 | 69722a1a717 |
13 | 3091ab3223b |
14 | 165415ca667 |
15 | ae430b44c1 |
hex | 62077a3083 |
421032243331 has 4 divisors (see below), whose sum is σ = 481179706672. Its totient is φ = 360884779992.
The previous prime is 421032243329. The next prime is 421032243389. The reversal of 421032243331 is 133342230124.
It is a happy number.
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 421032243331 - 21 = 421032243329 is a prime.
It is a super-2 number, since 2×4210322433312 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 421032243331.
It is not an unprimeable number, because it can be changed into a prime (421032243301) 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, 30073731660 + ... + 30073731673.
It is an arithmetic number, because the mean of its divisors is an integer number (120294926668).
Almost surely, 2421032243331 is an apocalyptic number.
421032243331 is a deficient number, since it is larger than the sum of its proper divisors (60147463341).
421032243331 is an equidigital number, since it uses as much as digits as its factorization.
421032243331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60147463340.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 421032243331 its reverse (133342230124), we get a palindrome (554374473455).
The spelling of 421032243331 in words is "four hundred twenty-one billion, thirty-two million, two hundred forty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •