Base | Representation |
---|---|
bin | 101110111100100010000… |
… | …011010111000010110101 |
3 | 102102102002212202221222112 |
4 | 232330202003113002311 |
5 | 410324013441323321 |
6 | 10510013542140405 |
7 | 452035363245614 |
oct | 56744203270265 |
9 | 12372085687875 |
10 | 3226091745461 |
11 | 10341a5760482 |
12 | 4412a3721705 |
13 | 1a52b0606000 |
14 | b220235187b |
15 | 58db8640a5b |
hex | 2ef220d70b5 |
3226091745461 has 16 divisors (see below), whose sum is σ = 3495460799040. Its totient is φ = 2977376603760.
The previous prime is 3226091745439. The next prime is 3226091745551. The reversal of 3226091745461 is 1645471906223.
3226091745461 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 3226091745461 - 218 = 3226091483317 is a prime.
It is a super-2 number, since 2×32260917454612 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3226091745761) 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, 11912246 + ... + 12180056.
It is an arithmetic number, because the mean of its divisors is an integer number (218466299940).
Almost surely, 23226091745461 is an apocalyptic number.
It is an amenable number.
3226091745461 is a deficient number, since it is larger than the sum of its proper divisors (269369053579).
3226091745461 is an equidigital number, since it uses as much as digits as its factorization.
3226091745461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 273333 (or 273307 counting only the distinct ones).
The product of its (nonzero) digits is 2177280, while the sum is 50.
The spelling of 3226091745461 in words is "three trillion, two hundred twenty-six billion, ninety-one million, seven hundred forty-five thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •