Base | Representation |
---|---|
bin | 101111011111000000001… |
… | …010101111110100001111 |
3 | 102112221122100021111120211 |
4 | 233133000022233310033 |
5 | 411430314140023211 |
6 | 10535014400023251 |
7 | 454515523142116 |
oct | 57370012576417 |
9 | 12487570244524 |
10 | 3263104220431 |
11 | 1048969299770 |
12 | 4484b3001b27 |
13 | 1a892b751283 |
14 | b3d13c42c7d |
15 | 59d32be9e21 |
hex | 2f7c02afd0f |
3263104220431 has 4 divisors (see below), whose sum is σ = 3559750058664. Its totient is φ = 2966458382200.
The previous prime is 3263104220419. The next prime is 3263104220447. The reversal of 3263104220431 is 1340224013623.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 3263104220431 - 211 = 3263104218383 is a prime.
It is a super-2 number, since 2×32631042204312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3263104220393 and 3263104220402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3263104220401) 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, 148322919100 + ... + 148322919121.
It is an arithmetic number, because the mean of its divisors is an integer number (889937514666).
Almost surely, 23263104220431 is an apocalyptic number.
3263104220431 is a deficient number, since it is larger than the sum of its proper divisors (296645838233).
3263104220431 is a wasteful number, since it uses less digits than its factorization.
3263104220431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 296645838232.
The product of its (nonzero) digits is 20736, while the sum is 31.
The spelling of 3263104220431 in words is "three trillion, two hundred sixty-three billion, one hundred four million, two hundred twenty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •