Base | Representation |
---|---|
bin | 1100000010010101… |
… | …0111101110111101 |
3 | 22100011201220221222 |
4 | 3000211113232331 |
5 | 23104120201023 |
6 | 1252340003125 |
7 | 143032143152 |
oct | 30045275675 |
9 | 8304656858 |
10 | 3231022013 |
11 | 140891172a |
12 | 7620904a5 |
13 | 3c6510a5b |
14 | 229182229 |
15 | 13d9c9cc8 |
hex | c0957bbd |
3231022013 has 4 divisors (see below), whose sum is σ = 3234929760. Its totient is φ = 3227114268.
The previous prime is 3231021977. The next prime is 3231022073. The reversal of 3231022013 is 3102201323.
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 3231022013 - 28 = 3231021757 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3231021982 and 3231022000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3231022073) 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, 1952633 + ... + 1954286.
It is an arithmetic number, because the mean of its divisors is an integer number (808732440).
Almost surely, 23231022013 is an apocalyptic number.
It is an amenable number.
3231022013 is a deficient number, since it is larger than the sum of its proper divisors (3907747).
3231022013 is an equidigital number, since it uses as much as digits as its factorization.
3231022013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3907746.
The product of its (nonzero) digits is 216, while the sum is 17.
The square root of 3231022013 is about 56842.0795977769. The cubic root of 3231022013 is about 1478.3592135588.
Adding to 3231022013 its reverse (3102201323), we get a palindrome (6333223336).
The spelling of 3231022013 in words is "three billion, two hundred thirty-one million, twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •