Base | Representation |
---|---|
bin | 10100101100011100100… |
… | …110011011110001001001 |
3 | 12000221201120102000022222 |
4 | 110230130212123301021 |
5 | 141244442141342413 |
6 | 3005150554423425 |
7 | 204513211440635 |
oct | 24543446336111 |
9 | 5027646360288 |
10 | 1422114012233 |
11 | 4a912a315a62 |
12 | 1ab747131b75 |
13 | a4149267505 |
14 | 4cb8b587dc5 |
15 | 26ed47aeb08 |
hex | 14b1c99bc49 |
1422114012233 has 8 divisors (see below), whose sum is σ = 1505232630720. Its totient is φ = 1339822445040.
The previous prime is 1422114012229. The next prime is 1422114012283. The reversal of 1422114012233 is 3322104112241.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1422114012233 - 22 = 1422114012229 is a prime.
It is a super-3 number, since 3×14221140122333 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1422114012203) 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, 206759285 + ... + 206766162.
It is an arithmetic number, because the mean of its divisors is an integer number (188154078840).
Almost surely, 21422114012233 is an apocalyptic number.
It is an amenable number.
1422114012233 is a deficient number, since it is larger than the sum of its proper divisors (83118618487).
1422114012233 is a wasteful number, since it uses less digits than its factorization.
1422114012233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 413525647.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 1422114012233 its reverse (3322104112241), we get a palindrome (4744218124474).
The spelling of 1422114012233 in words is "one trillion, four hundred twenty-two billion, one hundred fourteen million, twelve thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •