Base | Representation |
---|---|
bin | 1011000111111000110000… |
… | …1001010001000011000001 |
3 | 1121022012002022100101202002 |
4 | 2301332030021101003001 |
5 | 3100334243010143243 |
6 | 42002235131233345 |
7 | 2401411565240051 |
oct | 261761411210301 |
9 | 47265068311662 |
10 | 12230123131073 |
11 | 399584773a251 |
12 | 14563435a8855 |
13 | 6a93ac755c73 |
14 | 303d265db561 |
15 | 163200be1eb8 |
hex | b1f8c2510c1 |
12230123131073 has 2 divisors, whose sum is σ = 12230123131074. Its totient is φ = 12230123131072.
The previous prime is 12230123131069. The next prime is 12230123131123. The reversal of 12230123131073 is 37013132103221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9165078102544 + 3065045028529 = 3027388^2 + 1750727^2 .
It is a cyclic number.
It is not a de Polignac number, because 12230123131073 - 22 = 12230123131069 is a prime.
It is a super-2 number, since 2×122301231310732 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12230123131013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6115061565536 + 6115061565537.
It is an arithmetic number, because the mean of its divisors is an integer number (6115061565537).
Almost surely, 212230123131073 is an apocalyptic number.
It is an amenable number.
12230123131073 is a deficient number, since it is larger than the sum of its proper divisors (1).
12230123131073 is an equidigital number, since it uses as much as digits as its factorization.
12230123131073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4536, while the sum is 29.
Adding to 12230123131073 its reverse (37013132103221), we get a palindrome (49243255234294).
The spelling of 12230123131073 in words is "twelve trillion, two hundred thirty billion, one hundred twenty-three million, one hundred thirty-one thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •