Base | Representation |
---|---|
bin | 1101001010000101010… |
… | …1101110001001101111 |
3 | 210121110110210010121020 |
4 | 3102201111232021233 |
5 | 12200420023001411 |
6 | 251502123305223 |
7 | 22221415601502 |
oct | 3224125561157 |
9 | 717413703536 |
10 | 226045125231 |
11 | 87957642292 |
12 | 3798607b213 |
13 | 18415232193 |
14 | ad251a1139 |
15 | 5d2ec8d606 |
hex | 34a156e26f |
226045125231 has 8 divisors (see below), whose sum is σ = 306501864960. Its totient is φ = 148142567832.
The previous prime is 226045125227. The next prime is 226045125253. The reversal of 226045125231 is 132521540622.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 226045125231 - 22 = 226045125227 is a prime.
It is a super-2 number, since 2×2260451252312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 226045125192 and 226045125201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (226045125281) 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, 638545375 + ... + 638545728.
It is an arithmetic number, because the mean of its divisors is an integer number (38312733120).
Almost surely, 2226045125231 is an apocalyptic number.
226045125231 is a deficient number, since it is larger than the sum of its proper divisors (80456739729).
226045125231 is a wasteful number, since it uses less digits than its factorization.
226045125231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1277091165.
The product of its (nonzero) digits is 28800, while the sum is 33.
Adding to 226045125231 its reverse (132521540622), we get a palindrome (358566665853).
The spelling of 226045125231 in words is "two hundred twenty-six billion, forty-five million, one hundred twenty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •