Base | Representation |
---|---|
bin | 110100011001000101011010… |
… | …110100100110110100000011 |
3 | 1010012212011000222122200020101 |
4 | 310121011122310212310003 |
5 | 220200214203343444021 |
6 | 2134022301454423231 |
7 | 66351312343353601 |
oct | 6431053264466403 |
9 | 1105764028580211 |
10 | 230422224203011 |
11 | 67468575516425 |
12 | 21a15454801b17 |
13 | 9b7595146ac39 |
14 | 40c86d09d6871 |
15 | 1b98c268caa91 |
hex | d1915ad26d03 |
230422224203011 has 8 divisors (see below), whose sum is σ = 242787736900800. Its totient is φ = 218080514226600.
The previous prime is 230422224202969. The next prime is 230422224203033. The reversal of 230422224203011 is 110302422224032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 230422224203011 - 231 = 230420076719363 is a prime.
It is a super-2 number, since 2×2304222242030112 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (230422224206011) 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, 5950660465 + ... + 5950699186.
It is an arithmetic number, because the mean of its divisors is an integer number (30348467112600).
Almost surely, 2230422224203011 is an apocalyptic number.
230422224203011 is a deficient number, since it is larger than the sum of its proper divisors (12365512697789).
230422224203011 is a wasteful number, since it uses less digits than its factorization.
230422224203011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11901360689.
The product of its (nonzero) digits is 9216, while the sum is 28.
Adding to 230422224203011 its reverse (110302422224032), we get a palindrome (340724646427043).
The spelling of 230422224203011 in words is "two hundred thirty trillion, four hundred twenty-two billion, two hundred twenty-four million, two hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.351 sec. • engine limits •