Base | Representation |
---|---|
bin | 111111111001011… |
… | …001111100110111 |
3 | 2202201011220112022 |
4 | 333321121330313 |
5 | 4143413404421 |
6 | 254212543355 |
7 | 35364650441 |
oct | 7771317467 |
9 | 2681156468 |
10 | 1072013111 |
11 | 50013a354 |
12 | 25b021b5b |
13 | 1411320b0 |
14 | a2535491 |
15 | 641a87ab |
hex | 3fe59f37 |
1072013111 has 8 divisors (see below), whose sum is σ = 1154941200. Its totient is φ = 989151552.
The previous prime is 1072013087. The next prime is 1072013119. The reversal of 1072013111 is 1113102701.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1072013111 is a prime.
It is a super-2 number, since 2×10720131112 = 2298424220311796642, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1072013111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1072013119) 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, 19811 + ... + 50363.
It is an arithmetic number, because the mean of its divisors is an integer number (144367650).
Almost surely, 21072013111 is an apocalyptic number.
1072013111 is a deficient number, since it is larger than the sum of its proper divisors (82928089).
1072013111 is a wasteful number, since it uses less digits than its factorization.
1072013111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33265.
The product of its (nonzero) digits is 42, while the sum is 17.
The square root of 1072013111 is about 32741.6113073257. The cubic root of 1072013111 is about 1023.4501617536.
Adding to 1072013111 its reverse (1113102701), we get a palindrome (2185115812).
The spelling of 1072013111 in words is "one billion, seventy-two million, thirteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •