Base | Representation |
---|---|
bin | 11110011110111010… |
… | …10000100100100010 |
3 | 1120020112111021201001 |
4 | 33033131100210202 |
5 | 232004024040100 |
6 | 11303532302214 |
7 | 1116360035455 |
oct | 171735204442 |
9 | 46215437631 |
10 | 16365455650 |
11 | 6a38967065 |
12 | 320891196a |
13 | 170a6c128b |
14 | b1370349c |
15 | 65bb33d6a |
hex | 3cf750922 |
16365455650 has 48 divisors (see below), whose sum is σ = 31780805184. Its totient is φ = 6258098880.
The previous prime is 16365455609. The next prime is 16365455749. The reversal of 16365455650 is 5655456361.
16365455650 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (46).
It is a self number, because there is not a number n which added to its sum of digits gives 16365455650.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 3220912 + ... + 3225988.
It is an arithmetic number, because the mean of its divisors is an integer number (662100108).
Almost surely, 216365455650 is an apocalyptic number.
16365455650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
16365455650 is a deficient number, since it is larger than the sum of its proper divisors (15415349534).
16365455650 is a wasteful number, since it uses less digits than its factorization.
16365455650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7915 (or 7910 counting only the distinct ones).
The product of its (nonzero) digits is 1620000, while the sum is 46.
The spelling of 16365455650 in words is "sixteen billion, three hundred sixty-five million, four hundred fifty-five thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •