Base | Representation |
---|---|
bin | 1011010011101100… |
… | …1111110011011111 |
3 | 21211112200211022110 |
4 | 2310323033303133 |
5 | 22204032230421 |
6 | 1221111445103 |
7 | 135135505320 |
oct | 26473176337 |
9 | 7745624273 |
10 | 3035430111 |
11 | 131846a62a |
12 | 708686793 |
13 | 394b3acbc |
14 | 20b1ca447 |
15 | 12b741a76 |
hex | b4ecfcdf |
3035430111 has 8 divisors (see below), whose sum is σ = 4625417344. Its totient is φ = 1734531480.
The previous prime is 3035430091. The next prime is 3035430113. The reversal of 3035430111 is 1110345303.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3035430111 - 29 = 3035429599 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 144544291 = 3035430111 / (3 + 0 + 3 + 5 + 4 + 3 + 0 + 1 + 1 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3035430113) 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, 72272125 + ... + 72272166.
It is an arithmetic number, because the mean of its divisors is an integer number (578177168).
Almost surely, 23035430111 is an apocalyptic number.
3035430111 is a deficient number, since it is larger than the sum of its proper divisors (1589987233).
3035430111 is a wasteful number, since it uses less digits than its factorization.
3035430111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 144544301.
The product of its (nonzero) digits is 540, while the sum is 21.
The square root of 3035430111 is about 55094.7375980683. The cubic root of 3035430111 is about 1447.9050382295.
Adding to 3035430111 its reverse (1110345303), we get a palindrome (4145775414).
The spelling of 3035430111 in words is "three billion, thirty-five million, four hundred thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •