Base | Representation |
---|---|
bin | 100100011100110… |
… | …0101011101111111 |
3 | 10011020101122100220 |
4 | 1020321211131333 |
5 | 10001100231411 |
6 | 321210152423 |
7 | 42210540456 |
oct | 11071453577 |
9 | 3136348326 |
10 | 1223055231 |
11 | 578423552 |
12 | 2a1722713 |
13 | 166507428 |
14 | b8611b9d |
15 | 72591b06 |
hex | 48e6577f |
1223055231 has 8 divisors (see below), whose sum is σ = 1633946160. Its totient is φ = 813767232.
The previous prime is 1223055227. The next prime is 1223055233. The reversal of 1223055231 is 1325503221.
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 1223055231 - 22 = 1223055227 is a prime.
It is a super-2 number, since 2×12230552312 = 2991728196152926722, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1223055233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 398950 + ... + 402003.
It is an arithmetic number, because the mean of its divisors is an integer number (204243270).
Almost surely, 21223055231 is an apocalyptic number.
1223055231 is a deficient number, since it is larger than the sum of its proper divisors (410890929).
1223055231 is an equidigital number, since it uses as much as digits as its factorization.
1223055231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 801465.
The product of its (nonzero) digits is 1800, while the sum is 24.
The square root of 1223055231 is about 34972.2065503451. The cubic root of 1223055231 is about 1069.4209552229.
Adding to 1223055231 its reverse (1325503221), we get a palindrome (2548558452).
The spelling of 1223055231 in words is "one billion, two hundred twenty-three million, fifty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •