Base | Representation |
---|---|
bin | 1101001010010111110… |
… | …0110000000001010111 |
3 | 210121122212022102022201 |
4 | 3102211330300001113 |
5 | 12201044322342432 |
6 | 251513525105331 |
7 | 22223345146111 |
oct | 3224574600127 |
9 | 717585272281 |
10 | 226122465367 |
11 | 87997267057 |
12 | 379a7b58247 |
13 | 18428270986 |
14 | ad315743b1 |
15 | 5d36968ee7 |
hex | 34a5f30057 |
226122465367 has 4 divisors (see below), whose sum is σ = 226123424136. Its totient is φ = 226121506600.
The previous prime is 226122465329. The next prime is 226122465419. The reversal of 226122465367 is 763564221622.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 226122465367 - 223 = 226114076759 is a prime.
It is a super-2 number, since 2×2261224653672 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (226122462367) 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, 148617 + ... + 688717.
It is an arithmetic number, because the mean of its divisors is an integer number (56530856034).
Almost surely, 2226122465367 is an apocalyptic number.
226122465367 is a deficient number, since it is larger than the sum of its proper divisors (958769).
226122465367 is an equidigital number, since it uses as much as digits as its factorization.
226122465367 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 958768.
The product of its digits is 1451520, while the sum is 46.
Adding to 226122465367 its reverse (763564221622), we get a palindrome (989686686989).
The spelling of 226122465367 in words is "two hundred twenty-six billion, one hundred twenty-two million, four hundred sixty-five thousand, three hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •