Base | Representation |
---|---|
bin | 1100000000111011… |
… | …0101101001010111 |
3 | 22022202121211100222 |
4 | 3000032311221113 |
5 | 23101112141343 |
6 | 1252005224555 |
7 | 142631012201 |
oct | 30016655127 |
9 | 8282554328 |
10 | 3225115223 |
11 | 1405547890 |
12 | 76010215b |
13 | 3c5223305 |
14 | 228485771 |
15 | 13d20ea68 |
hex | c03b5a57 |
3225115223 has 16 divisors (see below), whose sum is σ = 3675110400. Its totient is φ = 2801520480.
The previous prime is 3225115211. The next prime is 3225115241.
It is a happy number.
3225115223 is nontrivially palindromic in base 10.
3225115223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3225115223 - 24 = 3225115207 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3225115192 and 3225115201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3225117223) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 256733 + ... + 269001.
It is an arithmetic number, because the mean of its divisors is an integer number (229694400).
Almost surely, 23225115223 is an apocalyptic number.
3225115223 is a deficient number, since it is larger than the sum of its proper divisors (449995177).
3225115223 is a wasteful number, since it uses less digits than its factorization.
3225115223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13342.
The product of its digits is 3600, while the sum is 26.
The square root of 3225115223 is about 56790.0979308893. The cubic root of 3225115223 is about 1477.4577769911.
It can be divided in two parts, 32251 and 15223, that added together give a palindrome (47474).
The spelling of 3225115223 in words is "three billion, two hundred twenty-five million, one hundred fifteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •