Base | Representation |
---|---|
bin | 10101111000100010101101… |
… | …01001101001100111000011 |
3 | 20022101102222112212222221222 |
4 | 22330101112221221213003 |
5 | 22301413400414441144 |
6 | 250203021525505255 |
7 | 13064501434244552 |
oct | 1274212651514703 |
9 | 208342875788858 |
10 | 48122267343299 |
11 | 143735a2408a66 |
12 | 5492501b7222b |
13 | 20b0bab025b26 |
14 | bc51b726bd99 |
15 | 586b85c082ee |
hex | 2bc456a699c3 |
48122267343299 has 2 divisors, whose sum is σ = 48122267343300. Its totient is φ = 48122267343298.
The previous prime is 48122267343211. The next prime is 48122267343331. The reversal of 48122267343299 is 99234376222184.
48122267343299 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-48122267343299 is a prime.
It is a super-2 number, since 2×481222673432992 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (48122267342299) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24061133671649 + 24061133671650.
It is an arithmetic number, because the mean of its divisors is an integer number (24061133671650).
Almost surely, 248122267343299 is an apocalyptic number.
48122267343299 is a deficient number, since it is larger than the sum of its proper divisors (1).
48122267343299 is an equidigital number, since it uses as much as digits as its factorization.
48122267343299 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 62705664, while the sum is 62.
The spelling of 48122267343299 in words is "forty-eight trillion, one hundred twenty-two billion, two hundred sixty-seven million, three hundred forty-three thousand, two hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •