Base | Representation |
---|---|
bin | 11011010110100110010100… |
… | …100110011111011101011111 |
3 | 120202221120221000110120110002 |
4 | 123112212110212133131133 |
5 | 111231444333410040332 |
6 | 1103505055205004515 |
7 | 34224255620060015 |
oct | 3326462446373537 |
9 | 522846830416402 |
10 | 120300232111967 |
11 | 35371050896686 |
12 | 115aaba83b373b |
13 | 5218356376c2b |
14 | 219c7c2d528b5 |
15 | dd94423b3562 |
hex | 6d699499f75f |
120300232111967 has 2 divisors, whose sum is σ = 120300232111968. Its totient is φ = 120300232111966.
The previous prime is 120300232111921. The next prime is 120300232112041. The reversal of 120300232111967 is 769111232003021.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 120300232111967 - 26 = 120300232111903 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 120300232111967.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120300232111567) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60150116055983 + 60150116055984.
It is an arithmetic number, because the mean of its divisors is an integer number (60150116055984).
Almost surely, 2120300232111967 is an apocalyptic number.
120300232111967 is a deficient number, since it is larger than the sum of its proper divisors (1).
120300232111967 is an equidigital number, since it uses as much as digits as its factorization.
120300232111967 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27216, while the sum is 38.
Adding to 120300232111967 its reverse (769111232003021), we get a palindrome (889411464114988).
The spelling of 120300232111967 in words is "one hundred twenty trillion, three hundred billion, two hundred thirty-two million, one hundred eleven thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •