Base | Representation |
---|---|
bin | 100111101100010101010… |
… | …1111000101001111110011 |
3 | 201022112011000021121210002 |
4 | 1033120222233011033303 |
5 | 1203340001303420001 |
6 | 15334050353100215 |
7 | 1102064023144634 |
oct | 117305257051763 |
9 | 21275130247702 |
10 | 5455325451251 |
11 | 1813654aa7295 |
12 | 74134155766b |
13 | 3075868703c0 |
14 | 14c07965788b |
15 | 96d8b2a146b |
hex | 4f62abc53f3 |
5455325451251 has 8 divisors (see below), whose sum is σ = 5877764835600. Its totient is φ = 5033285919072.
The previous prime is 5455325451239. The next prime is 5455325451263. The reversal of 5455325451251 is 1521545235545.
It is an interprime number because it is at equal distance from previous prime (5455325451239) and next prime (5455325451263).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5455325451251 - 210 = 5455325450227 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5455325451196 and 5455325451205.
It is not an unprimeable number, because it can be changed into a prime (5455325451221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 99934700 + ... + 99989273.
It is an arithmetic number, because the mean of its divisors is an integer number (734720604450).
Almost surely, 25455325451251 is an apocalyptic number.
5455325451251 is a deficient number, since it is larger than the sum of its proper divisors (422439384349).
5455325451251 is a wasteful number, since it uses less digits than its factorization.
5455325451251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 199926085.
The product of its digits is 3000000, while the sum is 47.
The spelling of 5455325451251 in words is "five trillion, four hundred fifty-five billion, three hundred twenty-five million, four hundred fifty-one thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.146 sec. • engine limits •