Search a number
-
+
10000000561161 = 313733512469463
BaseRepresentation
bin1001000110000100111001…
…1110110011000000001001
31022101222202020021202121010
42101201032132303000021
52302320000120424121
633133534205034133
72051322223202322
oct221411636630011
938358666252533
1010000000561161
113205a81687696
121156097b55949
13576cc42c3a80
14268007237449
151251ca004376
hex9184e7b3009

10000000561161 has 16 divisors (see below), whose sum is σ = 14555673458816. Its totient is φ = 6069547230336.

The previous prime is 10000000561157. The next prime is 10000000561181. The reversal of 10000000561161 is 16116500000001.

It is not a de Polignac number, because 10000000561161 - 22 = 10000000561157 is a prime.

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

It is a Duffinian number.

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

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

Almost surely, 210000000561161 is an apocalyptic number.

It is an amenable number.

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

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

10000000561161 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 3512469552.

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

Adding to 10000000561161 its reverse (16116500000001), we get a palindrome (26116500561162).

The spelling of 10000000561161 in words is "ten trillion, five hundred sixty-one thousand, one hundred sixty-one".

Divisors: 1 3 13 39 73 219 949 2847 3512469463 10537408389 45662103019 136986309057 256410270799 769230812397 3333333520387 10000000561161