Base | Representation |
---|---|
bin | 1100000000010011… |
… | …1000011100001111 |
3 | 22022120201020010121 |
4 | 3000010320130033 |
5 | 23044430131411 |
6 | 1251433245411 |
7 | 142566561661 |
oct | 30004703417 |
9 | 8276636117 |
10 | 3222505231 |
11 | 1404024970 |
12 | 75b263867 |
13 | 3c481b33a |
14 | 227da6531 |
15 | 13cd96571 |
hex | c013870f |
3222505231 has 16 divisors (see below), whose sum is σ = 3582931968. Its totient is φ = 2873692800.
The previous prime is 3222505219. The next prime is 3222505283. The reversal of 3222505231 is 1325052223.
It is not a de Polignac number, because 3222505231 - 25 = 3222505199 is a prime.
It is a super-2 number, since 2×32225052312 = 20769079927644726722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3222505196 and 3222505205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3222505291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 168546 + ... + 186688.
It is an arithmetic number, because the mean of its divisors is an integer number (223933248).
Almost surely, 23222505231 is an apocalyptic number.
3222505231 is a deficient number, since it is larger than the sum of its proper divisors (360426737).
3222505231 is a wasteful number, since it uses less digits than its factorization.
3222505231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18462.
The product of its (nonzero) digits is 3600, while the sum is 25.
The square root of 3222505231 is about 56767.1139921698. The cubic root of 3222505231 is about 1477.0591148861.
Adding to 3222505231 its reverse (1325052223), we get a palindrome (4547557454).
The spelling of 3222505231 in words is "three billion, two hundred twenty-two million, five hundred five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •