Base | Representation |
---|---|
bin | 1101101010100110000100… |
… | …0000011111101010010101 |
3 | 1222012102020120102202000022 |
4 | 3122221201000133222111 |
5 | 3432134031304333140 |
6 | 51542330055154525 |
7 | 3110356664151041 |
oct | 332514100375225 |
9 | 58172216382008 |
10 | 15025423121045 |
11 | 4873278704717 |
12 | 182803b975a45 |
13 | 84cb7830147c |
14 | 39d33d121021 |
15 | 1b0ca45660b5 |
hex | daa6101fa95 |
15025423121045 has 32 divisors (see below), whose sum is σ = 19665284921568. Its totient is φ = 10974832017408.
The previous prime is 15025423121021. The next prime is 15025423121083. The reversal of 15025423121045 is 54012132452051.
It can be written as a sum of positive squares in 16 ways, for example, as 2943417178321 + 12082005942724 = 1715639^2 + 3475918^2 .
It is a cyclic number.
It is not a de Polignac number, because 15025423121045 - 28 = 15025423120789 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 15025423120996 and 15025423121014.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6028502 + ... + 8148231.
It is an arithmetic number, because the mean of its divisors is an integer number (614540153799).
Almost surely, 215025423121045 is an apocalyptic number.
It is an amenable number.
15025423121045 is a deficient number, since it is larger than the sum of its proper divisors (4639861800523).
15025423121045 is a wasteful number, since it uses less digits than its factorization.
15025423121045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14177129.
The product of its (nonzero) digits is 48000, while the sum is 35.
Adding to 15025423121045 its reverse (54012132452051), we get a palindrome (69037555573096).
The spelling of 15025423121045 in words is "fifteen trillion, twenty-five billion, four hundred twenty-three million, one hundred twenty-one thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •