Base | Representation |
---|---|
bin | 1110111010011101111011… |
… | …1000011011010011000101 |
3 | 2011001121010222211102200200 |
4 | 3232213132320123103011 |
5 | 4122124321123041121 |
6 | 54512544512201113 |
7 | 3311455355020521 |
oct | 356473670332305 |
9 | 64047128742620 |
10 | 16397629502661 |
11 | 5252217407060 |
12 | 1a09b78b39199 |
13 | 91c39c99a4b4 |
14 | 409914340d81 |
15 | 1d6817629a26 |
hex | ee9dee1b4c5 |
16397629502661 has 48 divisors (see below), whose sum is σ = 28798538783040. Its totient is φ = 8861088821760.
The previous prime is 16397629502641. The next prime is 16397629502767. The reversal of 16397629502661 is 16620592679361.
16397629502661 is a `hidden beast` number, since 1 + 6 + 3 + 9 + 7 + 62 + 9 + 502 + 6 + 61 = 666.
It is not a de Polignac number, because 16397629502661 - 25 = 16397629502629 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16397629502641) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 256365270 + ... + 256429223.
It is an arithmetic number, because the mean of its divisors is an integer number (599969557980).
Almost surely, 216397629502661 is an apocalyptic number.
16397629502661 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
16397629502661 is a deficient number, since it is larger than the sum of its proper divisors (12400909280379).
16397629502661 is a wasteful number, since it uses less digits than its factorization.
16397629502661 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 512794546 (or 512794543 counting only the distinct ones).
The product of its (nonzero) digits is 44089920, while the sum is 63.
The spelling of 16397629502661 in words is "sixteen trillion, three hundred ninety-seven billion, six hundred twenty-nine million, five hundred two thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •