Base | Representation |
---|---|
bin | 100101111100100100110… |
… | …0010100101011000111001 |
3 | 200110120122220101202102112 |
4 | 1023321021202211120321 |
5 | 1140421440432201103 |
6 | 15031515315142105 |
7 | 1045536410262026 |
oct | 113711142453071 |
9 | 20416586352375 |
10 | 5215324100153 |
11 | 1730896544a42 |
12 | 7029215a4935 |
13 | 2baa59117a0b |
14 | 1405ccb3654d |
15 | 909e1179cd8 |
hex | 4be498a5639 |
5215324100153 has 8 divisors (see below), whose sum is σ = 5342644615560. Its totient is φ = 5088009179520.
The previous prime is 5215324100141. The next prime is 5215324100159. The reversal of 5215324100153 is 3510014235125.
It can be written as a sum of positive squares in 4 ways, for example, as 1510765473424 + 3704558626729 = 1229132^2 + 1924723^2 .
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 5215324100153 - 222 = 5215319905849 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5215324100159) 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, 520163 + ... + 3271271.
It is an arithmetic number, because the mean of its divisors is an integer number (667830576945).
Almost surely, 25215324100153 is an apocalyptic number.
It is an amenable number.
5215324100153 is a deficient number, since it is larger than the sum of its proper divisors (127320515407).
5215324100153 is a wasteful number, since it uses less digits than its factorization.
5215324100153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2797387.
The product of its (nonzero) digits is 18000, while the sum is 32.
Adding to 5215324100153 its reverse (3510014235125), we get a palindrome (8725338335278).
The spelling of 5215324100153 in words is "five trillion, two hundred fifteen billion, three hundred twenty-four million, one hundred thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •