Base | Representation |
---|---|
bin | 11011011101110011001001… |
… | …110001010100101100110111 |
3 | 120211200220010101221011002112 |
4 | 123131303021301110230313 |
5 | 111313101223104223332 |
6 | 1104524251110401235 |
7 | 34305103555346444 |
oct | 3335631161245467 |
9 | 524626111834075 |
10 | 120795045382967 |
11 | 35541988aa888a |
12 | 1166aa8036021b |
13 | 5252c01a77497 |
14 | 21b87233889cb |
15 | de72529a7db2 |
hex | 6ddcc9c54b37 |
120795045382967 has 2 divisors, whose sum is σ = 120795045382968. Its totient is φ = 120795045382966.
The previous prime is 120795045382951. The next prime is 120795045382969. The reversal of 120795045382967 is 769283540597021.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 120795045382967 - 24 = 120795045382951 is a prime.
Together with 120795045382969, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 120795045382897 and 120795045382906.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120795045382969) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60397522691483 + 60397522691484.
It is an arithmetic number, because the mean of its divisors is an integer number (60397522691484).
It is a 1-persistent number, because it is pandigital, but 2⋅120795045382967 = 241590090765934 is not.
Almost surely, 2120795045382967 is an apocalyptic number.
120795045382967 is a deficient number, since it is larger than the sum of its proper divisors (1).
120795045382967 is an equidigital number, since it uses as much as digits as its factorization.
120795045382967 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 228614400, while the sum is 68.
The spelling of 120795045382967 in words is "one hundred twenty trillion, seven hundred ninety-five billion, forty-five million, three hundred eighty-two thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •