Base | Representation |
---|---|
bin | 100101111100110010000… |
… | …1000011111100101001001 |
3 | 200110121210222220021201101 |
4 | 1023321210020133211021 |
5 | 1140423344140323244 |
6 | 15032031453421401 |
7 | 1045553435405131 |
oct | 113714410374511 |
9 | 20417728807641 |
10 | 5215770245449 |
11 | 1730aa5368565 |
12 | 702a26a9a861 |
13 | 2baaca69500a |
14 | 1406320adac1 |
15 | 90a1a4060d4 |
hex | 4be6421f949 |
5215770245449 has 8 divisors (see below), whose sum is σ = 5389153459200. Its totient is φ = 5042707816800.
The previous prime is 5215770245437. The next prime is 5215770245453. The reversal of 5215770245449 is 9445420775125.
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 5215770245449 - 231 = 5213622761801 is a prime.
It is a super-2 number, since 2×52157702454492 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5215770245449.
It is not an unprimeable number, because it can be changed into a prime (5215770045449) 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, 80163217 + ... + 80228254.
It is an arithmetic number, because the mean of its divisors is an integer number (673644182400).
Almost surely, 25215770245449 is an apocalyptic number.
It is an amenable number.
5215770245449 is a deficient number, since it is larger than the sum of its proper divisors (173383213751).
5215770245449 is a wasteful number, since it uses less digits than its factorization.
5215770245449 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 160392551.
The product of its (nonzero) digits is 14112000, while the sum is 55.
The spelling of 5215770245449 in words is "five trillion, two hundred fifteen billion, seven hundred seventy million, two hundred forty-five thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •