Base | Representation |
---|---|
bin | 1100000000100101… |
… | …1101100100101101 |
3 | 22022122222020010212 |
4 | 3000021131210231 |
5 | 23100232042101 |
6 | 1251515112205 |
7 | 142613022323 |
oct | 30011354455 |
9 | 8278866125 |
10 | 3223705901 |
11 | 1404774a59 |
12 | 75b742665 |
13 | 3c4b4b9b0 |
14 | 2281d9d13 |
15 | 13d0321bb |
hex | c025d92d |
3223705901 has 4 divisors (see below), whose sum is σ = 3471683292. Its totient is φ = 2975728512.
The previous prime is 3223705861. The next prime is 3223705943. The reversal of 3223705901 is 1095073223.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 364237225 + 2859468676 = 19085^2 + 53474^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3223705901 is a prime.
It is a super-2 number, since 2×32237059012 = 20784559472284443602, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3223705301) 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, 123988676 + ... + 123988701.
It is an arithmetic number, because the mean of its divisors is an integer number (867920823).
Almost surely, 23223705901 is an apocalyptic number.
It is an amenable number.
3223705901 is a deficient number, since it is larger than the sum of its proper divisors (247977391).
3223705901 is a wasteful number, since it uses less digits than its factorization.
3223705901 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 247977390.
The product of its (nonzero) digits is 11340, while the sum is 32.
The square root of 3223705901 is about 56777.6884083880. The cubic root of 3223705901 is about 1477.2425374336.
The spelling of 3223705901 in words is "three billion, two hundred twenty-three million, seven hundred five thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •