Base | Representation |
---|---|
bin | 1111000011000011011000… |
… | …1010000110000111000001 |
3 | 2011120200212001012010220220 |
4 | 3300300312022012013001 |
5 | 4132033402343442241 |
6 | 55104420250053253 |
7 | 3325226364012312 |
oct | 360606612060701 |
9 | 64520761163826 |
10 | 16545122640321 |
11 | 52a9824444450 |
12 | 1a3268011a229 |
13 | 930276a86b52 |
14 | 412b06bb6609 |
15 | 1da59b0c5166 |
hex | f0c362861c1 |
16545122640321 has 32 divisors (see below), whose sum is σ = 24304934289408. Its totient is φ = 9927962432640.
The previous prime is 16545122640289. The next prime is 16545122640331. The reversal of 16545122640321 is 12304622154561.
It is not a de Polignac number, because 16545122640321 - 25 = 16545122640289 is a prime.
It is a super-3 number, since 3×165451226403213 (a number of 41 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (16545122640331) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2012140 + ... + 6094173.
It is an arithmetic number, because the mean of its divisors is an integer number (759529196544).
Almost surely, 216545122640321 is an apocalyptic number.
16545122640321 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
16545122640321 is a deficient number, since it is larger than the sum of its proper divisors (7759811649087).
16545122640321 is a wasteful number, since it uses less digits than its factorization.
16545122640321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8106941.
The product of its (nonzero) digits is 345600, while the sum is 42.
Adding to 16545122640321 its reverse (12304622154561), we get a palindrome (28849744794882).
The spelling of 16545122640321 in words is "sixteen trillion, five hundred forty-five billion, one hundred twenty-two million, six hundred forty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •