Base | Representation |
---|---|
bin | 1100110010110000… |
… | …0101110010110011 |
3 | 22212022212212111010 |
4 | 3030230011302303 |
5 | 24013113011011 |
6 | 1324432522003 |
7 | 151046311614 |
oct | 31454056263 |
9 | 8768785433 |
10 | 3434110131 |
11 | 1502513851 |
12 | 7ba0b0303 |
13 | 42960983a |
14 | 248129c0b |
15 | 1517441a6 |
hex | ccb05cb3 |
3434110131 has 32 divisors (see below), whose sum is σ = 4735180800. Its totient is φ = 2212654464.
The previous prime is 3434110129. The next prime is 3434110153. The reversal of 3434110131 is 1310114343.
3434110131 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 3434110131 - 21 = 3434110129 is a prime.
It is a super-2 number, since 2×34341101312 = 23586224783673674322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3434110098 and 3434110107.
It is not an unprimeable number, because it can be changed into a prime (3434110531) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4684641 + ... + 4685373.
It is an arithmetic number, because the mean of its divisors is an integer number (147974400).
Almost surely, 23434110131 is an apocalyptic number.
3434110131 is a deficient number, since it is larger than the sum of its proper divisors (1301070669).
3434110131 is a wasteful number, since it uses less digits than its factorization.
3434110131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1155.
The product of its (nonzero) digits is 432, while the sum is 21.
The square root of 3434110131 is about 58601.2809672280. The cubic root of 3434110131 is about 1508.7064241248.
Adding to 3434110131 its reverse (1310114343), we get a palindrome (4744224474).
The spelling of 3434110131 in words is "three billion, four hundred thirty-four million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •