Base | Representation |
---|---|
bin | 111001010101100110… |
… | …0010011101100111101 |
3 | 102202211020002210111112 |
4 | 1302223030103230331 |
5 | 4004133042332103 |
6 | 132322105131405 |
7 | 11616210025046 |
oct | 1625314235475 |
9 | 382736083445 |
10 | 123131214653 |
11 | 482463a7027 |
12 | 1ba44489b65 |
13 | b7c3b211c5 |
14 | 5d611478cd |
15 | 3309d17cd8 |
hex | 1cab313b3d |
123131214653 has 4 divisors (see below), whose sum is σ = 123486060000. Its totient is φ = 122776369308.
The previous prime is 123131214611. The next prime is 123131214667. The reversal of 123131214653 is 356412131321.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 123131214653 - 216 = 123131149117 is a prime.
It is a super-2 number, since 2×1231312146532 (a number of 23 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 (123131214853) 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, 177422153 + ... + 177422846.
It is an arithmetic number, because the mean of its divisors is an integer number (30871515000).
Almost surely, 2123131214653 is an apocalyptic number.
It is an amenable number.
123131214653 is a deficient number, since it is larger than the sum of its proper divisors (354845347).
123131214653 is an equidigital number, since it uses as much as digits as its factorization.
123131214653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 354845346.
The product of its digits is 12960, while the sum is 32.
Adding to 123131214653 its reverse (356412131321), we get a palindrome (479543345974).
The spelling of 123131214653 in words is "one hundred twenty-three billion, one hundred thirty-one million, two hundred fourteen thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •