Base | Representation |
---|---|
bin | 11110010111110001… |
… | …00100010111001100 |
3 | 1120002100200111220000 |
4 | 33023320210113030 |
5 | 231343202140430 |
6 | 11253551324300 |
7 | 1115031340416 |
oct | 171370442714 |
9 | 46070614800 |
10 | 16305505740 |
11 | 6a0803a887 |
12 | 31b0820690 |
13 | 16cb161064 |
14 | b097799b6 |
15 | 656740e60 |
hex | 3cbe245cc |
16305505740 has 120 divisors (see below), whose sum is σ = 51419757312. Its totient is φ = 4325287680.
The previous prime is 16305505739. The next prime is 16305505771. The reversal of 16305505740 is 4750550361.
16305505740 is a `hidden beast` number, since 1 + 6 + 30 + 5 + 50 + 574 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 16305505695 and 16305505704.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 283072 + ... + 335768.
Almost surely, 216305505740 is an apocalyptic number.
16305505740 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16305505740, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25709878656).
16305505740 is an abundant number, since it is smaller than the sum of its proper divisors (35114251572).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16305505740 is a wasteful number, since it uses less digits than its factorization.
16305505740 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52909 (or 52898 counting only the distinct ones).
The product of its (nonzero) digits is 63000, while the sum is 36.
The spelling of 16305505740 in words is "sixteen billion, three hundred five million, five hundred five thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •