Base | Representation |
---|---|
bin | 1011101011100000… |
… | …1110010111111010 |
3 | 22002111121210120111 |
4 | 2322320032113322 |
5 | 22410114113424 |
6 | 1235040214534 |
7 | 140460422401 |
oct | 27270162772 |
9 | 8074553514 |
10 | 3135301114 |
11 | 1369883150 |
12 | 73600a44a |
13 | 3ac737b7a |
14 | 21a586638 |
15 | 1353bd194 |
hex | bae0e5fa |
3135301114 has 8 divisors (see below), whose sum is σ = 5130492768. Its totient is φ = 1425136860.
The previous prime is 3135301087. The next prime is 3135301129. The reversal of 3135301114 is 4111035313.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×31353011142 = 19660226150899281992, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 142513687 = 3135301114 / (3 + 1 + 3 + 5 + 3 + 0 + 1 + 1 + 1 + 4).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 71256822 + ... + 71256865.
It is an arithmetic number, because the mean of its divisors is an integer number (641311596).
Almost surely, 23135301114 is an apocalyptic number.
3135301114 is a deficient number, since it is larger than the sum of its proper divisors (1995191654).
3135301114 is a wasteful number, since it uses less digits than its factorization.
3135301114 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142513700.
The product of its (nonzero) digits is 540, while the sum is 22.
The square root of 3135301114 is about 55993.7595987267. The cubic root of 3135301114 is about 1463.6135413418.
Adding to 3135301114 its reverse (4111035313), we get a palindrome (7246336427).
The spelling of 3135301114 in words is "three billion, one hundred thirty-five million, three hundred one thousand, one hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •