Search a number
-
+
146102504441 = 10921125125309
BaseRepresentation
bin1000100000010001100…
…0110100101111111001
3111222010010122020002012
42020010120310233321
54343204220120231
6151041335415305
713361361540305
oct2100430645771
9458103566065
10146102504441
1156a64067043
1224395524535
1310a14c6a47a
1470ddcc0d05
153c01855e2b
hex2204634bf9

146102504441 has 16 divisors (see below), whose sum is σ = 148737758400. Its totient is φ = 143496360000.

The previous prime is 146102504413. The next prime is 146102504447. The reversal of 146102504441 is 144405201641.

It is a cyclic number.

It is not a de Polignac number, because 146102504441 - 226 = 146035395577 is a prime.

It is a Duffinian number.

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

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 2146102504441 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 25880.

The product of its (nonzero) digits is 15360, while the sum is 32.

The spelling of 146102504441 in words is "one hundred forty-six billion, one hundred two million, five hundred four thousand, four hundred forty-one".

Divisors: 1 109 211 251 22999 25309 27359 52961 2758681 5340199 5772749 6352559 582081691 692428931 1340389949 146102504441