Base | Representation |
---|---|
bin | 101000000001100011101… |
… | …0000111101111111000101 |
3 | 201110212210021012020102201 |
4 | 1100003013100331333011 |
5 | 1210111321210044221 |
6 | 15411025032434501 |
7 | 1105266314106454 |
oct | 120030720757705 |
9 | 21425707166381 |
10 | 5500901253061 |
11 | 1830a123927a5 |
12 | 74a140848a31 |
13 | 30b96ab56b76 |
14 | 150360570b9b |
15 | 9815752c891 |
hex | 500c743dfc5 |
5500901253061 has 2 divisors, whose sum is σ = 5500901253062. Its totient is φ = 5500901253060.
The previous prime is 5500901253041. The next prime is 5500901253097. The reversal of 5500901253061 is 1603521090055.
5500901253061 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5281953062500 + 218948190561 = 2298250^2 + 467919^2 .
It is a cyclic number.
It is not a de Polignac number, because 5500901253061 - 215 = 5500901220293 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5500901253061.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5500901253011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2750450626530 + 2750450626531.
It is an arithmetic number, because the mean of its divisors is an integer number (2750450626531).
Almost surely, 25500901253061 is an apocalyptic number.
It is an amenable number.
5500901253061 is a deficient number, since it is larger than the sum of its proper divisors (1).
5500901253061 is an equidigital number, since it uses as much as digits as its factorization.
5500901253061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40500, while the sum is 37.
The spelling of 5500901253061 in words is "five trillion, five hundred billion, nine hundred one million, two hundred fifty-three thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •