Search a number
-
+
146631404360563 = 2729333116130537
BaseRepresentation
bin100001010101110001001000…
…110001010001001101110011
3201020011211021200110221212221
4201111301020301101031303
5123204402104004014223
61235505312012501511
742612524615230633
oct4125611061211563
9636154250427787
10146631404360563
11427a30360a8091
121454219477a897
1363a8388a0a265
14282cdd80d46c3
1511e4345372b5d
hex855c48c51373

146631404360563 has 8 divisors (see below), whose sum is σ = 146729180641680. Its totient is φ = 146533660352640.

The previous prime is 146631404360561. The next prime is 146631404360641. The reversal of 146631404360563 is 365063404136641.

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 146631404360563 - 21 = 146631404360561 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 146631404360563.

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

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

Almost surely, 2146631404360563 is an apocalyptic number.

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

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

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

The sum of its prime factors is 16136597.

The product of its (nonzero) digits is 11197440, while the sum is 52.

The spelling of 146631404360563 in words is "one hundred forty-six trillion, six hundred thirty-one billion, four hundred four million, three hundred sixty thousand, five hundred sixty-three".

Divisors: 1 2729 3331 9090299 16130537 44020235473 53730818747 146631404360563