Base | Representation |
---|---|
bin | 101110111011110001000… |
… | …100110100001110001111 |
3 | 102102022222121121011211212 |
4 | 232323301010310032033 |
5 | 410320323112343120 |
6 | 10505400230205035 |
7 | 452006125014311 |
oct | 56736104641617 |
9 | 12368877534755 |
10 | 3225270043535 |
11 | 1033913947681 |
12 | 4410b44b377b |
13 | 1a51ac2c5157 |
14 | b21651777b1 |
15 | 58d6b42d6c5 |
hex | 2eef113438f |
3225270043535 has 16 divisors (see below), whose sum is σ = 3896135888832. Its totient is φ = 2563049664000.
The previous prime is 3225270043531. The next prime is 3225270043559. The reversal of 3225270043535 is 5353400725223.
It is not a de Polignac number, because 3225270043535 - 22 = 3225270043531 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3225270043492 and 3225270043501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3225270043531) 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, 1973066 + ... + 3216135.
It is an arithmetic number, because the mean of its divisors is an integer number (243508493052).
Almost surely, 23225270043535 is an apocalyptic number.
3225270043535 is a deficient number, since it is larger than the sum of its proper divisors (670865845297).
3225270043535 is a wasteful number, since it uses less digits than its factorization.
3225270043535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5190034.
The product of its (nonzero) digits is 756000, while the sum is 41.
Adding to 3225270043535 its reverse (5353400725223), we get a palindrome (8578670768758).
The spelling of 3225270043535 in words is "three trillion, two hundred twenty-five billion, two hundred seventy million, forty-three thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •