Base | Representation |
---|---|
bin | 1100000000100100… |
… | …1110001000111001 |
3 | 22022122212000102101 |
4 | 3000021032020321 |
5 | 23100223031211 |
6 | 1251513503401 |
7 | 142612340110 |
oct | 30011161071 |
9 | 8278760371 |
10 | 3223642681 |
11 | 1404731506 |
12 | 75b711b61 |
13 | 3c4b28c9c |
14 | 2281c0c77 |
15 | 13d01d5c1 |
hex | c024e239 |
3223642681 has 4 divisors (see below), whose sum is σ = 3684163072. Its totient is φ = 2763122292.
The previous prime is 3223642621. The next prime is 3223642693. The reversal of 3223642681 is 1862463223.
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 not a de Polignac number, because 3223642681 - 211 = 3223640633 is a prime.
It is a super-2 number, since 2×32236426812 = 20783744269529735522, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3223642681.
It is not an unprimeable number, because it can be changed into a prime (3223642621) 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, 230260185 + ... + 230260198.
It is an arithmetic number, because the mean of its divisors is an integer number (921040768).
Almost surely, 23223642681 is an apocalyptic number.
It is an amenable number.
3223642681 is a deficient number, since it is larger than the sum of its proper divisors (460520391).
3223642681 is an equidigital number, since it uses as much as digits as its factorization.
3223642681 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 460520390.
The product of its digits is 82944, while the sum is 37.
The square root of 3223642681 is about 56777.1316728839. The cubic root of 3223642681 is about 1477.2328806507.
The spelling of 3223642681 in words is "three billion, two hundred twenty-three million, six hundred forty-two thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •