Base | Representation |
---|---|
bin | 1110111010101… |
… | …00100100011100 |
3 | 22201110002220010 |
4 | 13131110210130 |
5 | 224013030230 |
6 | 20225523220 |
7 | 3046363401 |
oct | 735244434 |
9 | 281402803 |
10 | 125126940 |
11 | 646a37a4 |
12 | 35aa3510 |
13 | 1cc00713 |
14 | 128922a8 |
15 | aeb99b0 |
hex | 775491c |
125126940 has 48 divisors (see below), whose sum is σ = 351937152. Its totient is φ = 33216576.
The previous prime is 125126917. The next prime is 125126941. The reversal of 125126940 is 49621521.
It is a super-2 number, since 2×1251269402 = 31313502227527200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 125126898 and 125126907.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125126941) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9027 + ... + 18213.
It is an arithmetic number, because the mean of its divisors is an integer number (7332024).
Almost surely, 2125126940 is an apocalyptic number.
125126940 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
125126940 is an abundant number, since it is smaller than the sum of its proper divisors (226810212).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125126940 is a wasteful number, since it uses less digits than its factorization.
125126940 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9426 (or 9424 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 30.
The square root of 125126940 is about 11186.0153763527. The cubic root of 125126940 is about 500.1691960723.
The spelling of 125126940 in words is "one hundred twenty-five million, one hundred twenty-six thousand, nine hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •