Base | Representation |
---|---|
bin | 1110111101001… |
… | …11111001101001 |
3 | 22202002110002210 |
4 | 13132213321221 |
5 | 224104441030 |
6 | 20241115333 |
7 | 3052314456 |
oct | 736477151 |
9 | 282073083 |
10 | 125468265 |
11 | 6490718a |
12 | 36028b49 |
13 | 1ccbcba0 |
14 | 1294082d |
15 | b035bb0 |
hex | 77a7e69 |
125468265 has 32 divisors (see below), whose sum is σ = 218211840. Its totient is φ = 61191936.
The previous prime is 125468261. The next prime is 125468303. The reversal of 125468265 is 562864521.
It is not a de Polignac number, because 125468265 - 22 = 125468261 is a prime.
It is a super-2 number, since 2×1254682652 = 31484571044220450, which contains 22 as substring.
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is not an unprimeable number, because it can be changed into a prime (125468261) 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, 18304 + ... + 24206.
It is an arithmetic number, because the mean of its divisors is an integer number (6819120).
Almost surely, 2125468265 is an apocalyptic number.
125468265 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
125468265 is a deficient number, since it is larger than the sum of its proper divisors (92743575).
125468265 is a wasteful number, since it uses less digits than its factorization.
125468265 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6033.
The product of its digits is 115200, while the sum is 39.
The square root of 125468265 is about 11201.2617592841. The cubic root of 125468265 is about 500.6235753177.
The spelling of 125468265 in words is "one hundred twenty-five million, four hundred sixty-eight thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •