Base | Representation |
---|---|
bin | 111000000011110011… |
… | …1010001010111110001 |
3 | 102111201222001002012011 |
4 | 1300013213101113301 |
5 | 3433023011211234 |
6 | 131145511202521 |
7 | 11461204040152 |
oct | 1600747212761 |
9 | 374658032164 |
10 | 120386819569 |
11 | 47068248415 |
12 | 1b3b9376441 |
13 | b4773925a3 |
14 | 5b80879929 |
15 | 31e8e13b64 |
hex | 1c079d15f1 |
120386819569 has 2 divisors, whose sum is σ = 120386819570. Its totient is φ = 120386819568.
The previous prime is 120386819563. The next prime is 120386819573. The reversal of 120386819569 is 965918683021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 114302819569 + 6084000000 = 338087^2 + 78000^2 .
It is an emirp because it is prime and its reverse (965918683021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 120386819569 - 23 = 120386819561 is a prime.
It is a super-2 number, since 2×1203868195692 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (120386819561) 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, 60193409784 + 60193409785.
It is an arithmetic number, because the mean of its divisors is an integer number (60193409785).
Almost surely, 2120386819569 is an apocalyptic number.
It is an amenable number.
120386819569 is a deficient number, since it is larger than the sum of its proper divisors (1).
120386819569 is an equidigital number, since it uses as much as digits as its factorization.
120386819569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5598720, while the sum is 58.
The spelling of 120386819569 in words is "one hundred twenty billion, three hundred eighty-six million, eight hundred nineteen thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •