Base | Representation |
---|---|
bin | 10100101100101010101011… |
… | …01000101001000110111101 |
3 | 12222011012200220102122221220 |
4 | 22112111111220221012331 |
5 | 21431210120004400323 |
6 | 240445221355143553 |
7 | 12405236133254145 |
oct | 1226252550510675 |
9 | 188135626378856 |
10 | 45515205153213 |
11 | 13558987803754 |
12 | 513119a144bb9 |
13 | 1c520b0995573 |
14 | b34d3a62d925 |
15 | 53de4cdac0e3 |
hex | 296555a291bd |
45515205153213 has 16 divisors (see below), whose sum is σ = 65086291385280. Its totient is φ = 28204059596544.
The previous prime is 45515205153203. The next prime is 45515205153227. The reversal of 45515205153213 is 31235150251554.
45515205153213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 45515205153213 - 28 = 45515205152957 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (45515205153203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7533132556 + ... + 7533138597.
It is an arithmetic number, because the mean of its divisors is an integer number (4067893211580).
Almost surely, 245515205153213 is an apocalyptic number.
It is an amenable number.
45515205153213 is a deficient number, since it is larger than the sum of its proper divisors (19571086232067).
45515205153213 is a wasteful number, since it uses less digits than its factorization.
45515205153213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15066271228.
The product of its (nonzero) digits is 450000, while the sum is 42.
The spelling of 45515205153213 in words is "forty-five trillion, five hundred fifteen billion, two hundred five million, one hundred fifty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •