Search a number
-
+
10140056263133 = 47234599196721
BaseRepresentation
bin1001001110001110101001…
…1100111001100111011101
31022220101020221210121002022
42103203222130321213131
52312113313400410013
633322135540505525
72064411022055126
oct223435234714735
938811227717068
1010140056263133
11325a412456515
1211792643ab2a5
135872845895c4
14270ad200504d
15128b75a7a008
hex938ea7399dd

10140056263133 has 8 divisors (see below), whose sum is σ = 10356244709760. Its totient is φ = 9923886256960.

The previous prime is 10140056263121. The next prime is 10140056263217. The reversal of 10140056263133 is 33136265004101.

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

It is a cyclic number.

It is not a de Polignac number, because 10140056263133 - 230 = 10138982521309 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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

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

Almost surely, 210140056263133 is an apocalyptic number.

It is an amenable number.

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

10140056263133 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 9220227.

The product of its (nonzero) digits is 38880, while the sum is 35.

The spelling of 10140056263133 in words is "ten trillion, one hundred forty billion, fifty-six million, two hundred sixty-three thousand, one hundred thirty-three".

Divisors: 1 47 23459 1102573 9196721 432245887 215745877939 10140056263133