Base | Representation |
---|---|
bin | 111011001110110101… |
… | …0010000101100000000 |
3 | 110011022201122110200220 |
4 | 1312131222100230000 |
5 | 4041000440343041 |
6 | 134233503143040 |
7 | 12122053650234 |
oct | 1663552205400 |
9 | 404281573626 |
10 | 127199152896 |
11 | 49a43673262 |
12 | 2079a8a4a80 |
13 | bcc183bb5a |
14 | 62295045c4 |
15 | 349700cd66 |
hex | 1d9da90b00 |
127199152896 has 288 divisors, whose sum is σ = 359821443072. Its totient is φ = 39810355200.
The previous prime is 127199152879. The next prime is 127199152897. The reversal of 127199152896 is 698251991721.
127199152896 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (127199152897) 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, 274727961 + ... + 274728423.
Almost surely, 2127199152896 is an apocalyptic number.
127199152896 is a gapful number since it is divisible by the number (16) 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 127199152896, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (179910721536).
127199152896 is an abundant number, since it is smaller than the sum of its proper divisors (232622290176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
127199152896 is a wasteful number, since it uses less digits than its factorization.
127199152896 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 759 (or 745 counting only the distinct ones).
The product of its digits is 4898880, while the sum is 60.
The spelling of 127199152896 in words is "one hundred twenty-seven billion, one hundred ninety-nine million, one hundred fifty-two thousand, eight hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •