Base | Representation |
---|---|
bin | 111111000001100010011000… |
… | …0111110010100101000010001 |
3 | 2200200211210022110011211212012 |
4 | 1332003010300332110220101 |
5 | 1040130204244133043101 |
6 | 5243011454420512305 |
7 | 224524362563546615 |
oct | 17603046076245021 |
9 | 2620753273154765 |
10 | 554365135440401 |
11 | 150701a2a7611aa |
12 | 5221381624b695 |
13 | 1aa4353c39b8ac |
14 | 9ac75b6a35345 |
15 | 44154991d6bbb |
hex | 1f83130f94a11 |
554365135440401 has 2 divisors, whose sum is σ = 554365135440402. Its totient is φ = 554365135440400.
The previous prime is 554365135440397. The next prime is 554365135440517. The reversal of 554365135440401 is 104044531563455.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 405865345210000 + 148499790230401 = 20146100^2 + 12186049^2 .
It is a cyclic number.
It is not a de Polignac number, because 554365135440401 - 22 = 554365135440397 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 554365135440401.
It is not a weakly prime, because it can be changed into another prime (554365135440101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 277182567720200 + 277182567720201.
It is an arithmetic number, because the mean of its divisors is an integer number (277182567720201).
Almost surely, 2554365135440401 is an apocalyptic number.
It is an amenable number.
554365135440401 is a deficient number, since it is larger than the sum of its proper divisors (1).
554365135440401 is an equidigital number, since it uses as much as digits as its factorization.
554365135440401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8640000, while the sum is 50.
The spelling of 554365135440401 in words is "five hundred fifty-four trillion, three hundred sixty-five billion, one hundred thirty-five million, four hundred forty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •