Base | Representation |
---|---|
bin | 1110101111010101101110… |
… | …1101101111101111010001 |
3 | 2010101022200101111000200210 |
4 | 3223311123231233233101 |
5 | 4111011302240421411 |
6 | 54245050203034333 |
7 | 3261606642600162 |
oct | 353653355575721 |
9 | 63338611430623 |
10 | 16206450326481 |
11 | 51891317873a8 |
12 | 1998b0350b9a9 |
13 | 907352c856cc |
14 | 400579953769 |
15 | 1d187878cca6 |
hex | ebd5bb6fbd1 |
16206450326481 has 8 divisors (see below), whose sum is σ = 21818392672960. Its totient is φ = 10699404098832.
The previous prime is 16206450326413. The next prime is 16206450326483. The reversal of 16206450326481 is 18462305460261.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 16206450326481 - 214 = 16206450310097 is a prime.
It is a super-2 number, since 2×162064503264812 (a number of 27 digits) contains 22 as substring.
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 16206450326481.
It is not an unprimeable number, because it can be changed into a prime (16206450326483) 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, 26224029346 + ... + 26224029963.
It is an arithmetic number, because the mean of its divisors is an integer number (2727299084120).
Almost surely, 216206450326481 is an apocalyptic number.
It is an amenable number.
16206450326481 is a deficient number, since it is larger than the sum of its proper divisors (5611942346479).
16206450326481 is a wasteful number, since it uses less digits than its factorization.
16206450326481 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52448059415.
The product of its (nonzero) digits is 1658880, while the sum is 48.
The spelling of 16206450326481 in words is "sixteen trillion, two hundred six billion, four hundred fifty million, three hundred twenty-six thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •