Search a number
-
+
105013201133 = 791999664973
BaseRepresentation
bin110000111001101000…
…1100100100011101101
3101001001112212100100202
41201303101210203231
53210031334414013
6120124205203245
710405216324151
oct1416321444355
9331045770322
10105013201133
114059923a335
1218428860525
139b97310c49
145122b9b061
152ae93ec858
hex18734648ed

105013201133 has 8 divisors (see below), whose sum is σ = 106395840000. Its totient is φ = 103631896368.

The previous prime is 105013201129. The next prime is 105013201147. The reversal of 105013201133 is 331102310501.

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 105013201133 - 22 = 105013201129 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 2105013201133 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 667051.

The product of its (nonzero) digits is 270, while the sum is 20.

Adding to 105013201133 its reverse (331102310501), we get a palindrome (436115511634).

The spelling of 105013201133 in words is "one hundred five billion, thirteen million, two hundred one thousand, one hundred thirty-three".

Divisors: 1 79 1999 157921 664973 52532867 1329281027 105013201133