Base | Representation |
---|---|
bin | 1000111101111000011… |
… | …1000111110000001001 |
3 | 112201122000202020200001 |
4 | 2033132013013300021 |
5 | 10010443331422243 |
6 | 154434131443001 |
7 | 14062336432216 |
oct | 2173607076011 |
9 | 481560666601 |
10 | 154050264073 |
11 | 5a3723a3532 |
12 | 25a33156461 |
13 | 116b071c514 |
14 | 765566ab0d |
15 | 4019482a4d |
hex | 23de1c7c09 |
154050264073 has 2 divisors, whose sum is σ = 154050264074. Its totient is φ = 154050264072.
The previous prime is 154050264031. The next prime is 154050264079. The reversal of 154050264073 is 370462050451.
154050264073 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 can be written as a sum of positive squares in only one way, i.e., 93520979344 + 60529284729 = 305812^2 + 246027^2 .
It is a cyclic number.
It is not a de Polignac number, because 154050264073 - 217 = 154050133001 is a prime.
It is a super-2 number, since 2×1540502640732 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (154050264079) 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, 77025132036 + 77025132037.
It is an arithmetic number, because the mean of its divisors is an integer number (77025132037).
Almost surely, 2154050264073 is an apocalyptic number.
It is an amenable number.
154050264073 is a deficient number, since it is larger than the sum of its proper divisors (1).
154050264073 is an equidigital number, since it uses as much as digits as its factorization.
154050264073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 100800, while the sum is 37.
The spelling of 154050264073 in words is "one hundred fifty-four billion, fifty million, two hundred sixty-four thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •