Base | Representation |
---|---|
bin | 1100000000111100… |
… | …1110000010101111 |
3 | 22022202210220110000 |
4 | 3000033032002233 |
5 | 23101123341101 |
6 | 1252011315343 |
7 | 142631606424 |
oct | 30017160257 |
9 | 8282726400 |
10 | 3225215151 |
11 | 1405605974 |
12 | 76014bb53 |
13 | 3c5259942 |
14 | 2284add4b |
15 | 13d22e486 |
hex | c03ce0af |
3225215151 has 20 divisors (see below), whose sum is σ = 4860564192. Its totient is φ = 2131109568.
The previous prime is 3225215131. The next prime is 3225215167. The reversal of 3225215151 is 1515125223.
It is not a de Polignac number, because 3225215151 - 29 = 3225214639 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3225215131) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 167031 + ... + 185336.
Almost surely, 23225215151 is an apocalyptic number.
3225215151 is a deficient number, since it is larger than the sum of its proper divisors (1635349041).
3225215151 is a wasteful number, since it uses less digits than its factorization.
3225215151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 352492 (or 352483 counting only the distinct ones).
The product of its digits is 3000, while the sum is 27.
The square root of 3225215151 is about 56790.9777253394. The cubic root of 3225215151 is about 1477.4730361747.
The spelling of 3225215151 in words is "three billion, two hundred twenty-five million, two hundred fifteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •