Base | Representation |
---|---|
bin | 1010001010010101… |
… | …10001101011011001 |
3 | 112002012100001112002 |
4 | 11011022301223121 |
5 | 42133041420441 |
6 | 2301200330345 |
7 | 252122206634 |
oct | 50512615331 |
9 | 15065301462 |
10 | 5455420121 |
11 | 234a495978 |
12 | 10830139b5 |
13 | 68c305658 |
14 | 39a770c1b |
15 | 21de15b9b |
hex | 1452b1ad9 |
5455420121 has 2 divisors, whose sum is σ = 5455420122. Its totient is φ = 5455420120.
The previous prime is 5455420111. The next prime is 5455420123. The reversal of 5455420121 is 1210245545.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4898460121 + 556960000 = 69989^2 + 23600^2 .
It is a cyclic number.
It is not a de Polignac number, because 5455420121 - 222 = 5451225817 is a prime.
It is a super-2 number, since 2×54554201212 = 59523217393223309282, which contains 22 as substring.
Together with 5455420123, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (5455420123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2727710060 + 2727710061.
It is an arithmetic number, because the mean of its divisors is an integer number (2727710061).
Almost surely, 25455420121 is an apocalyptic number.
It is an amenable number.
5455420121 is a deficient number, since it is larger than the sum of its proper divisors (1).
5455420121 is an equidigital number, since it uses as much as digits as its factorization.
5455420121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8000, while the sum is 29.
The square root of 5455420121 is about 73860.8158701216. The cubic root of 5455420121 is about 1760.3920572225.
Adding to 5455420121 its reverse (1210245545), we get a palindrome (6665665666).
The spelling of 5455420121 in words is "five billion, four hundred fifty-five million, four hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •