Search a number
-
+
16637650143055 = 522714658722593
BaseRepresentation
bin1111001000011100000100…
…1110100000011101001111
32011220112200110000021222121
43302013001032200131033
54140042401414034210
655215121515353411
73335013323552434
oct362070116403517
964815613007877
1016637650143055
115334a95843777
121a485a3452867
13938c01417976
144173a3643b8b
151dcbb42b16da
hexf21c13a074f

16637650143055 has 8 divisors (see below), whose sum is σ = 20053132508592. Its totient is φ = 13251485223168.

The previous prime is 16637650143011. The next prime is 16637650143067. The reversal of 16637650143055 is 55034105673661.

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 16637650143055 - 29 = 16637650142543 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7329360162 + ... + 7329362431.

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

Almost surely, 216637650143055 is an apocalyptic number.

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

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

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

The sum of its prime factors is 14658722825.

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

The spelling of 16637650143055 in words is "sixteen trillion, six hundred thirty-seven billion, six hundred fifty million, one hundred forty-three thousand, fifty-five".

Divisors: 1 5 227 1135 14658722593 73293612965 3327530028611 16637650143055