Base | Representation |
---|---|
bin | 11011011000011111010001… |
… | …111100111000101010100111 |
3 | 120210102000011110101210022122 |
4 | 123120133101330320222213 |
5 | 111241111331231131211 |
6 | 1104044455015420155 |
7 | 34236534255311222 |
oct | 3330372174705247 |
9 | 523360143353278 |
10 | 120430110411431 |
11 | 354111397a2357 |
12 | 116101b438465b |
13 | 5227683c7a7c2 |
14 | 21a4bc41bc5b9 |
15 | ddc9e46d76db |
hex | 6d87d1f38aa7 |
120430110411431 has 2 divisors, whose sum is σ = 120430110411432. Its totient is φ = 120430110411430.
The previous prime is 120430110411343. The next prime is 120430110411439. The reversal of 120430110411431 is 134114011034021.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 120430110411431 - 226 = 120430043302567 is a prime.
It is a super-2 number, since 2×1204301104114312 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 120430110411431.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120430110411439) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60215055205715 + 60215055205716.
It is an arithmetic number, because the mean of its divisors is an integer number (60215055205716).
Almost surely, 2120430110411431 is an apocalyptic number.
120430110411431 is a deficient number, since it is larger than the sum of its proper divisors (1).
120430110411431 is an equidigital number, since it uses as much as digits as its factorization.
120430110411431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 26.
Adding to 120430110411431 its reverse (134114011034021), we get a palindrome (254544121445452).
The spelling of 120430110411431 in words is "one hundred twenty trillion, four hundred thirty billion, one hundred ten million, four hundred eleven thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •