Base | Representation |
---|---|
bin | 101111010010010111101… |
… | …111000110000000110001 |
3 | 102111122122002122112120201 |
4 | 233102113233012000301 |
5 | 411220024442341120 |
6 | 10524452444435201 |
7 | 453525440411311 |
oct | 57222757060061 |
9 | 12448562575521 |
10 | 3249540980785 |
11 | 1043139194000 |
12 | 445948848b01 |
13 | 1a7579784a98 |
14 | b33c877d441 |
15 | 597dc0dc40a |
hex | 2f497bc6031 |
3249540980785 has 16 divisors (see below), whose sum is σ = 4289101132032. Its totient is φ = 2363302526640.
The previous prime is 3249540980773. The next prime is 3249540980789. The reversal of 3249540980785 is 5870890459423.
3249540980785 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 3249540980785 - 211 = 3249540978737 is a prime.
It is a super-2 number, since 2×32495409807852 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3249540980789) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 244136169 + ... + 244149478.
It is an arithmetic number, because the mean of its divisors is an integer number (268068820752).
Almost surely, 23249540980785 is an apocalyptic number.
It is an amenable number.
3249540980785 is a deficient number, since it is larger than the sum of its proper divisors (1039560151247).
3249540980785 is an equidigital number, since it uses as much as digits as its factorization.
3249540980785 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 488285685 (or 488285663 counting only the distinct ones).
The product of its (nonzero) digits is 87091200, while the sum is 64.
The spelling of 3249540980785 in words is "three trillion, two hundred forty-nine billion, five hundred forty million, nine hundred eighty thousand, seven hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •