Base | Representation |
---|---|
bin | 11110101010110011… |
… | …00011000100101001 |
3 | 1120111111002002100220 |
4 | 33111121203010221 |
5 | 232210034134103 |
6 | 11321453120253 |
7 | 1122010301361 |
oct | 172531430451 |
9 | 46444062326 |
10 | 16465146153 |
11 | 6a8a167005 |
12 | 3236189089 |
13 | 1725256c41 |
14 | b22a539a1 |
15 | 665776c53 |
hex | 3d5663129 |
16465146153 has 32 divisors (see below), whose sum is σ = 23432198400. Its totient is φ = 10248038400.
The previous prime is 16465146151. The next prime is 16465146223. The reversal of 16465146153 is 35164156461.
16465146153 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 16465146153 - 21 = 16465146151 is a prime.
It is a super-2 number, since 2×164651461532 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (16465146151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8447023 + ... + 8448971.
It is an arithmetic number, because the mean of its divisors is an integer number (732256200).
Almost surely, 216465146153 is an apocalyptic number.
It is an amenable number.
16465146153 is a deficient number, since it is larger than the sum of its proper divisors (6967052247).
16465146153 is a wasteful number, since it uses less digits than its factorization.
16465146153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3217.
The product of its digits is 259200, while the sum is 42.
The spelling of 16465146153 in words is "sixteen billion, four hundred sixty-five million, one hundred forty-six thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •