Base | Representation |
---|---|
bin | 101111100000000010101… |
… | …100111000101111011101 |
3 | 102120001112010200122211112 |
4 | 233200002230320233131 |
5 | 411440110414404031 |
6 | 10535321233031405 |
7 | 454555266106565 |
oct | 57400254705735 |
9 | 12501463618745 |
10 | 3264220466141 |
11 | 104939139a688 |
12 | 4487649b5565 |
13 | 1a8a78a9c5ab |
14 | b3dbc1adda5 |
15 | 59d9abde62b |
hex | 2f802b38bdd |
3264220466141 has 4 divisors (see below), whose sum is σ = 3276265560384. Its totient is φ = 3252175371900.
The previous prime is 3264220466131. The next prime is 3264220466159. The reversal of 3264220466141 is 1416640224623.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 3264220466141 - 230 = 3263146724317 is a prime.
It is a super-3 number, since 3×32642204661413 (a number of 39 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3264220466131) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6022546715 + ... + 6022547256.
It is an arithmetic number, because the mean of its divisors is an integer number (819066390096).
Almost surely, 23264220466141 is an apocalyptic number.
It is an amenable number.
3264220466141 is a deficient number, since it is larger than the sum of its proper divisors (12045094243).
3264220466141 is a wasteful number, since it uses less digits than its factorization.
3264220466141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12045094242.
The product of its (nonzero) digits is 331776, while the sum is 41.
The spelling of 3264220466141 in words is "three trillion, two hundred sixty-four billion, two hundred twenty million, four hundred sixty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •