Base | Representation |
---|---|
bin | 1001010000001100011… |
… | …1001101110111011000 |
3 | 120012022121121012000221 |
4 | 2110003013031313120 |
5 | 10101030244412100 |
6 | 201010013205424 |
7 | 14325216551005 |
oct | 2240307156730 |
9 | 505277535027 |
10 | 158966013400 |
11 | 61465196787 |
12 | 26985490874 |
13 | 11cb4c9002c |
14 | 79a047a8ac |
15 | 4205ce601a |
hex | 25031cddd8 |
158966013400 has 96 divisors (see below), whose sum is σ = 385803878400. Its totient is φ = 60799939200.
The previous prime is 158966013391. The next prime is 158966013403. The reversal of 158966013400 is 4310669851.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (158966013403) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 19403305 + ... + 19411495.
It is an arithmetic number, because the mean of its divisors is an integer number (4018790400).
Almost surely, 2158966013400 is an apocalyptic number.
158966013400 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 158966013400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (192901939200).
158966013400 is an abundant number, since it is smaller than the sum of its proper divisors (226837865000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
158966013400 is a wasteful number, since it uses less digits than its factorization.
158966013400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12449 (or 12440 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 43.
The spelling of 158966013400 in words is "one hundred fifty-eight billion, nine hundred sixty-six million, thirteen thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •