Base | Representation |
---|---|
bin | 1111001001000… |
… | …01000000100100 |
3 | 22211222220221111 |
4 | 13210201000210 |
5 | 230003403100 |
6 | 20334154404 |
7 | 3101410000 |
oct | 744410044 |
9 | 284886844 |
10 | 127012900 |
11 | 65771743 |
12 | 36652a04 |
13 | 20410c81 |
14 | 12c23700 |
15 | b23d6ba |
hex | 7921024 |
127012900 has 135 divisors (see below), whose sum is σ = 336122801. Its totient is φ = 41653920.
The previous prime is 127012883. The next prime is 127012901. The reversal of 127012900 is 9210721.
The square root of 127012900 is 11270.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 45724644 + 81288256 = 6762^2 + 9016^2 .
It is a super-2 number, since 2×1270129002 = 32264553532820000, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (127012901) by changing a digit.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 5522289 + ... + 5522311.
Almost surely, 2127012900 is an apocalyptic number.
127012900 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
127012900 is the 11270-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 127012900
127012900 is an abundant number, since it is smaller than the sum of its proper divisors (209109901).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
127012900 is an equidigital number, since it uses as much as digits as its factorization.
127012900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88 (or 37 counting only the distinct ones).
The product of its (nonzero) digits is 252, while the sum is 22.
The cubic root of 127012900 is about 502.6695879004.
The spelling of 127012900 in words is "one hundred twenty-seven million, twelve thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •