Base | Representation |
---|---|
bin | 1111000011000101101010… |
… | …0110110010010001110001 |
3 | 2011120202102122211121012201 |
4 | 3300301122212302101301 |
5 | 4132041130420003131 |
6 | 55105001052423201 |
7 | 3325250500461250 |
oct | 360613246622161 |
9 | 64522378747181 |
10 | 16545734141041 |
11 | 52aa008637a46 |
12 | 1a32810a77b01 |
13 | 93034367b3b1 |
14 | 412b640b4797 |
15 | 1da5d4b15761 |
hex | f0c5a9b2471 |
16545734141041 has 8 divisors (see below), whose sum is σ = 18910004422400. Its totient is φ = 14181612353568.
The previous prime is 16545734141029. The next prime is 16545734141047. The reversal of 16545734141041 is 14014143754561.
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 16545734141041 - 213 = 16545734132849 is a prime.
It is a super-2 number, since 2×165457341410412 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 16545734140982 and 16545734141000.
It is not an unprimeable number, because it can be changed into a prime (16545734141047) 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, 36884601 + ... + 37330486.
It is an arithmetic number, because the mean of its divisors is an integer number (2363750552800).
Almost surely, 216545734141041 is an apocalyptic number.
It is an amenable number.
16545734141041 is a deficient number, since it is larger than the sum of its proper divisors (2364270281359).
16545734141041 is an equidigital number, since it uses as much as digits as its factorization.
16545734141041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74246943.
The product of its (nonzero) digits is 806400, while the sum is 46.
The spelling of 16545734141041 in words is "sixteen trillion, five hundred forty-five billion, seven hundred thirty-four million, one hundred forty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •