Search a number
-
+
110421430131 = 3172376191121
BaseRepresentation
bin110011011010110100…
…0010100111101110011
3101120000110101211211110
41212311220110331303
53302120341231011
6122421002244403
710656226445505
oct1466550247563
9346013354743
10110421430131
1142914022881
1219497ab6703
13a54990284c
1454b7165d75
152d140e0ba6
hex19b5a14f73

110421430131 has 16 divisors (see below), whose sum is σ = 155897349408. Its totient is φ = 69280358400.

The previous prime is 110421430121. The next prime is 110421430159. The reversal of 110421430131 is 131034124011.

It is not a de Polignac number, because 110421430131 - 215 = 110421397363 is a prime.

It is a super-2 number, since 2×1104214301312 (a number of 23 digits) contains 22 as substring.

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

It is not an unprimeable number, because it can be changed into a prime (110421430121) by changing a digit.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1166251 + ... + 1257371.

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

Almost surely, 2110421430131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 114902.

The product of its (nonzero) digits is 288, while the sum is 21.

Adding to 110421430131 its reverse (131034124011), we get a palindrome (241455554142).

The spelling of 110421430131 in words is "one hundred ten billion, four hundred twenty-one million, four hundred thirty thousand, one hundred thirty-one".

Divisors: 1 3 17 51 23761 71283 91121 273363 403937 1211811 1549057 4647171 2165126081 6495378243 36807143377 110421430131