Base | Representation |
---|---|
bin | 11011011010001101… |
… | …11110010100101000 |
3 | 1101222112201010202120 |
4 | 31231012332110220 |
5 | 220114123242233 |
6 | 10432111031240 |
7 | 1030443142404 |
oct | 155506762450 |
9 | 41875633676 |
10 | 14715446568 |
11 | 6271538899 |
12 | 2a2820b520 |
13 | 15068c8c44 |
14 | 9d8512104 |
15 | 5b1d574b3 |
hex | 36d1be528 |
14715446568 has 128 divisors (see below), whose sum is σ = 40479264000. Its totient is φ = 4437135360.
The previous prime is 14715446561. The next prime is 14715446659. The reversal of 14715446568 is 86564451741.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a self number, because there is not a number n which added to its sum of digits gives 14715446568.
It is not an unprimeable number, because it can be changed into a prime (14715446561) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2706813 + ... + 2712243.
It is an arithmetic number, because the mean of its divisors is an integer number (316244250).
Almost surely, 214715446568 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14715446568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20239632000).
14715446568 is an abundant number, since it is smaller than the sum of its proper divisors (25763817432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14715446568 is a wasteful number, since it uses less digits than its factorization.
14715446568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5715 (or 5711 counting only the distinct ones).
The product of its digits is 3225600, while the sum is 51.
The spelling of 14715446568 in words is "fourteen billion, seven hundred fifteen million, four hundred forty-six thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •