Base | Representation |
---|---|
bin | 11110101100111000… |
… | …11110000100010001 |
3 | 1120112201002101000222 |
4 | 33112130132010101 |
5 | 232224032024142 |
6 | 11323321122425 |
7 | 1122312355514 |
oct | 172634360421 |
9 | 46481071028 |
10 | 16482689297 |
11 | 6a99059478 |
12 | 3240029415 |
13 | 1728a89cb9 |
14 | b250dcd7b |
15 | 66708ebd2 |
hex | 3d671e111 |
16482689297 has 8 divisors (see below), whose sum is σ = 17509377600. Its totient is φ = 15471918864.
The previous prime is 16482689231. The next prime is 16482689317. The reversal of 16482689297 is 79298628461.
16482689297 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 16482689297 - 210 = 16482688273 is a prime.
It is a super-2 number, since 2×164826892972 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (16442689297) 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 7 ways as a sum of consecutive naturals, for example, 3977333 + ... + 3981474.
It is an arithmetic number, because the mean of its divisors is an integer number (2188672200).
Almost surely, 216482689297 is an apocalyptic number.
It is an amenable number.
16482689297 is a deficient number, since it is larger than the sum of its proper divisors (1026688303).
16482689297 is a wasteful number, since it uses less digits than its factorization.
16482689297 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7958935.
The product of its digits is 20901888, while the sum is 62.
The spelling of 16482689297 in words is "sixteen billion, four hundred eighty-two million, six hundred eighty-nine thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •