Base | Representation |
---|---|
bin | 1111000011000011001001… |
… | …0001110011110000010001 |
3 | 2011120200200111201101111010 |
4 | 3300300302101303300101 |
5 | 4132033234213202200 |
6 | 55104410003041133 |
7 | 3325224643540512 |
oct | 360606221636021 |
9 | 64520614641433 |
10 | 16545057553425 |
11 | 52a97a0729725 |
12 | 1a326623701a9 |
13 | 9302664486ab |
14 | 412adc2b2a09 |
15 | 1da59551a150 |
hex | f0c32473c11 |
16545057553425 has 24 divisors (see below), whose sum is σ = 27403605628416. Its totient is φ = 8808188607040.
The previous prime is 16545057553397. The next prime is 16545057553441. The reversal of 16545057553425 is 52435575054561.
It is not a de Polignac number, because 16545057553425 - 25 = 16545057553393 is a prime.
It is a super-2 number, since 2×165450575534252 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 197984049 + ... + 198067598.
It is an arithmetic number, because the mean of its divisors is an integer number (1141816901184).
Almost surely, 216545057553425 is an apocalyptic number.
16545057553425 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
16545057553425 is a deficient number, since it is larger than the sum of its proper divisors (10858548074991).
16545057553425 is a wasteful number, since it uses less digits than its factorization.
16545057553425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 396052217 (or 396052212 counting only the distinct ones).
The product of its (nonzero) digits is 63000000, while the sum is 57.
The spelling of 16545057553425 in words is "sixteen trillion, five hundred forty-five billion, fifty-seven million, five hundred fifty-three thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •