Base | Representation |
---|---|
bin | 111111001011110… |
… | …1000101100100111 |
3 | 12110202101112001102 |
4 | 1332113220230213 |
5 | 13320223001343 |
6 | 550213350315 |
7 | 103352524046 |
oct | 17627505447 |
9 | 5422345042 |
10 | 2120125223 |
11 | 998834507 |
12 | 4b203839b |
13 | 27a316288 |
14 | 16180855d |
15 | c61e03b8 |
hex | 7e5e8b27 |
2120125223 has 2 divisors, whose sum is σ = 2120125224. Its totient is φ = 2120125222.
The previous prime is 2120125193. The next prime is 2120125261. The reversal of 2120125223 is 3225210212.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2120125223 - 226 = 2053016359 is a prime.
It is a super-2 number, since 2×21201252232 = 8989861922401599458, which contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 2120125195 and 2120125204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2120127223) 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 as a sum of consecutive naturals, namely, 1060062611 + 1060062612.
It is an arithmetic number, because the mean of its divisors is an integer number (1060062612).
Almost surely, 22120125223 is an apocalyptic number.
2120125223 is a deficient number, since it is larger than the sum of its proper divisors (1).
2120125223 is an equidigital number, since it uses as much as digits as its factorization.
2120125223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 20.
The square root of 2120125223 is about 46044.8175476893. The cubic root of 2120125223 is about 1284.6569505211.
Adding to 2120125223 its reverse (3225210212), we get a palindrome (5345335435).
The spelling of 2120125223 in words is "two billion, one hundred twenty million, one hundred twenty-five thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •