[go: up one dir, main page]

Search a number
-
+
311105013 = 3283366437
BaseRepresentation
bin10010100010110…
…001010111110101
3210200101202211220
4102202301113311
51114120330023
650512020553
710465230462
oct2242612765
9720352756
10311105013
1114a67988a
1288231759
134c5b860b
142d464669
151c4a43e3
hex128b15f5

311105013 has 8 divisors (see below), whose sum is σ = 416273568. Its totient is φ = 206669904.

The previous prime is 311105009. The next prime is 311105027. The reversal of 311105013 is 310501113.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 311105013 - 22 = 311105009 is a prime.

It is a super-2 number, since 2×3111050132 = 193572658227460338, which contains 22 as substring.

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 311104983 and 311105001.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (311105413) 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, 182370 + ... + 184067.

It is an arithmetic number, because the mean of its divisors is an integer number (52034196).

Almost surely, 2311105013 is an apocalyptic number.

It is an amenable number.

311105013 is a deficient number, since it is larger than the sum of its proper divisors (105168555).

311105013 is a wasteful number, since it uses less digits than its factorization.

311105013 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 366723.

The product of its (nonzero) digits is 45, while the sum is 15.

The square root of 311105013 is about 17638.1692077154. The cubic root of 311105013 is about 677.5931439682.

Adding to 311105013 its reverse (310501113), we get a palindrome (621606126).

The spelling of 311105013 in words is "three hundred eleven million, one hundred five thousand, thirteen".

Divisors: 1 3 283 849 366437 1099311 103701671 311105013