Base | Representation |
---|---|
bin | 1110111010001… |
… | …11001110010001 |
3 | 22201100022220102 |
4 | 13131013032101 |
5 | 224004303043 |
6 | 20224422145 |
7 | 3046045124 |
oct | 735071621 |
9 | 281308812 |
10 | 125072273 |
11 | 64666717 |
12 | 35a77955 |
13 | 1cbb1881 |
14 | 1287a3bb |
15 | aea86b8 |
hex | 7747391 |
125072273 has 4 divisors (see below), whose sum is σ = 129385140. Its totient is φ = 120759408.
The previous prime is 125072237. The next prime is 125072279. The reversal of 125072273 is 372270521.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 22819729 + 102252544 = 4777^2 + 10112^2 .
It is a cyclic number.
It is not a de Polignac number, because 125072273 - 210 = 125071249 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29), and also a Moran number because the ratio is a prime number: 4312837 = 125072273 / (1 + 2 + 5 + 0 + 7 + 2 + 2 + 7 + 3).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (125072279) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2156390 + ... + 2156447.
It is an arithmetic number, because the mean of its divisors is an integer number (32346285).
Almost surely, 2125072273 is an apocalyptic number.
It is an amenable number.
125072273 is a deficient number, since it is larger than the sum of its proper divisors (4312867).
125072273 is an equidigital number, since it uses as much as digits as its factorization.
125072273 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4312866.
The product of its (nonzero) digits is 5880, while the sum is 29.
The square root of 125072273 is about 11183.5715672588. The cubic root of 125072273 is about 500.0963454339.
The spelling of 125072273 in words is "one hundred twenty-five million, seventy-two thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •