Base | Representation |
---|---|
bin | 111000000011100011… |
… | …1010111100100100001 |
3 | 102111201101022012000102 |
4 | 1300013013113210201 |
5 | 3433013341100403 |
6 | 131145012032145 |
7 | 11461042665461 |
oct | 1600707274441 |
9 | 374641265012 |
10 | 120378456353 |
11 | 47063555a71 |
12 | 1b3b6602655 |
13 | b475724a3c |
14 | 5b7d6ddba1 |
15 | 31e8310b88 |
hex | 1c071d7921 |
120378456353 has 2 divisors, whose sum is σ = 120378456354. Its totient is φ = 120378456352.
The previous prime is 120378456311. The next prime is 120378456361. The reversal of 120378456353 is 353654873021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 117160390369 + 3218065984 = 342287^2 + 56728^2 .
It is a cyclic number.
It is not a de Polignac number, because 120378456353 - 214 = 120378439969 is a prime.
It is a super-2 number, since 2×1203784563532 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 120378456298 and 120378456307.
It is not a weakly prime, because it can be changed into another prime (120378456953) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60189228176 + 60189228177.
It is an arithmetic number, because the mean of its divisors is an integer number (60189228177).
Almost surely, 2120378456353 is an apocalyptic number.
It is an amenable number.
120378456353 is a deficient number, since it is larger than the sum of its proper divisors (1).
120378456353 is an equidigital number, since it uses as much as digits as its factorization.
120378456353 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1814400, while the sum is 47.
The spelling of 120378456353 in words is "one hundred twenty billion, three hundred seventy-eight million, four hundred fifty-six thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •