Base | Representation |
---|---|
bin | 1011001101101100… |
… | …0110010000110001 |
3 | 21202210021021200021 |
4 | 2303123012100301 |
5 | 22131104201301 |
6 | 1214411323441 |
7 | 134411330524 |
oct | 26333062061 |
9 | 7683237607 |
10 | 3010225201 |
11 | 1305214825 |
12 | 700150581 |
13 | 38c854759 |
14 | 207b08bbb |
15 | 1294138a1 |
hex | b36c6431 |
3010225201 has 8 divisors (see below), whose sum is σ = 3126954600. Its totient is φ = 2894357760.
The previous prime is 3010225199. The next prime is 3010225223. The reversal of 3010225201 is 1025220103.
It can be written as a sum of positive squares in 4 ways, for example, as 1432546801 + 1577678400 = 37849^2 + 39720^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3010225201 - 21 = 3010225199 is a prime.
It is a super-2 number, since 2×30102252012 = 18122911521470980802, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3010225301) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 208366 + ... + 222343.
It is an arithmetic number, because the mean of its divisors is an integer number (390869325).
Almost surely, 23010225201 is an apocalyptic number.
It is an amenable number.
3010225201 is a deficient number, since it is larger than the sum of its proper divisors (116729399).
3010225201 is a wasteful number, since it uses less digits than its factorization.
3010225201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 430979.
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 3010225201 is about 54865.5192356730. The cubic root of 3010225201 is about 1443.8863001420.
Adding to 3010225201 its reverse (1025220103), we get a palindrome (4035445304).
The spelling of 3010225201 in words is "three billion, ten million, two hundred twenty-five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •