Base | Representation |
---|---|
bin | 1011111110100100… |
… | …0110100100000001 |
3 | 22022002000020211212 |
4 | 2333221012210001 |
5 | 23041044114131 |
6 | 1251013215505 |
7 | 142450642052 |
oct | 27751064401 |
9 | 8262006755 |
10 | 3215223041 |
11 | 13aaa00728 |
12 | 758931595 |
13 | 3c316b854 |
14 | 22702c729 |
15 | 13c408a2b |
hex | bfa46901 |
3215223041 has 4 divisors (see below), whose sum is σ = 3253960752. Its totient is φ = 3176485332.
The previous prime is 3215223007. The next prime is 3215223071. The reversal of 3215223041 is 1403225123.
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 a de Polignac number, because none of the positive numbers 2k-3215223041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3215222998 and 3215223016.
It is not an unprimeable number, because it can be changed into a prime (3215223071) 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, 19368731 + ... + 19368896.
It is an arithmetic number, because the mean of its divisors is an integer number (813490188).
Almost surely, 23215223041 is an apocalyptic number.
It is an amenable number.
3215223041 is a deficient number, since it is larger than the sum of its proper divisors (38737711).
3215223041 is an equidigital number, since it uses as much as digits as its factorization.
3215223041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38737710.
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 3215223041 is about 56702.9367934325. The cubic root of 3215223041 is about 1475.9456605179.
Adding to 3215223041 its reverse (1403225123), we get a palindrome (4618448164).
The spelling of 3215223041 in words is "three billion, two hundred fifteen million, two hundred twenty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •