Base | Representation |
---|---|
bin | 11011011111001001… |
… | …00000001101110000 |
3 | 1102002102102011110000 |
4 | 31233210200031300 |
5 | 220210211221000 |
6 | 10440144110000 |
7 | 1031454144300 |
oct | 155744401560 |
9 | 42072364400 |
10 | 14756742000 |
11 | 6292883750 |
12 | 2a3a005300 |
13 | 1512327300 |
14 | 9ddbc1600 |
15 | 5b57b3000 |
hex | 36f920370 |
14756742000 has 1800 divisors, whose sum is σ = 73245146832. Its totient is φ = 2830464000.
The previous prime is 14756741977. The next prime is 14756742031. The reversal of 14756742000 is 24765741.
It is a tau number, because it is divible by the number of its divisors (1800).
It is a super-2 number, since 2×147567420002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 359 ways as a sum of consecutive naturals, for example, 1135133994 + ... + 1135134006.
Almost surely, 214756742000 is an apocalyptic number.
14756742000 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 14756742000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36622573416).
14756742000 is an abundant number, since it is smaller than the sum of its proper divisors (58488404832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14756742000 is a wasteful number, since it uses less digits than its factorization.
14756742000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86 (or 41 counting only the distinct ones).
The product of its (nonzero) digits is 47040, while the sum is 36.
The spelling of 14756742000 in words is "fourteen billion, seven hundred fifty-six million, seven hundred forty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •