Base | Representation |
---|---|
bin | 111011001011111110… |
… | …0010001111100101000 |
3 | 110011002001010020101110 |
4 | 1312113330101330220 |
5 | 4040301410311402 |
6 | 134220154550320 |
7 | 12116510326143 |
oct | 1662774217450 |
9 | 404061106343 |
10 | 127103213352 |
11 | 499a44a5485 |
12 | 207727383a0 |
13 | bca79ba5ab |
14 | 621a88d05a |
15 | 348d8ab56c |
hex | 1d97f11f28 |
127103213352 has 64 divisors (see below), whose sum is σ = 334977019200. Its totient is φ = 40078471680.
The previous prime is 127103213327. The next prime is 127103213381. The reversal of 127103213352 is 253312301721.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 102852 + ... + 514572.
It is an arithmetic number, because the mean of its divisors is an integer number (5234015925).
Almost surely, 2127103213352 is an apocalyptic number.
127103213352 is a gapful number since it is divisible by the number (12) 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 127103213352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (167488509600).
127103213352 is an abundant number, since it is smaller than the sum of its proper divisors (207873805848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
127103213352 is a wasteful number, since it uses less digits than its factorization.
127103213352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 412426 (or 412422 counting only the distinct ones).
The product of its (nonzero) digits is 7560, while the sum is 30.
The spelling of 127103213352 in words is "one hundred twenty-seven billion, one hundred three million, two hundred thirteen thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •