Base | Representation |
---|---|
bin | 111010010000010010… |
… | …0100101010010100101 |
3 | 102221220110200111011220 |
4 | 1310200210211102211 |
5 | 4022201212344141 |
6 | 133245334050553 |
7 | 12016051545003 |
oct | 1644044452245 |
9 | 387813614156 |
10 | 125100512421 |
11 | 49066a83645 |
12 | 202b3aa9a59 |
13 | ba48b08a61 |
14 | 60aa8cda73 |
15 | 33c2b63766 |
hex | 1d209254a5 |
125100512421 has 4 divisors (see below), whose sum is σ = 166800683232. Its totient is φ = 83400341612.
The previous prime is 125100512413. The next prime is 125100512473. The reversal of 125100512421 is 124215001521.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 125100512421 - 23 = 125100512413 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 125100512391 and 125100512400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125100512401) 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, 20850085401 + ... + 20850085406.
It is an arithmetic number, because the mean of its divisors is an integer number (41700170808).
Almost surely, 2125100512421 is an apocalyptic number.
It is an amenable number.
125100512421 is a deficient number, since it is larger than the sum of its proper divisors (41700170811).
125100512421 is an equidigital number, since it uses as much as digits as its factorization.
125100512421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41700170810.
The product of its (nonzero) digits is 800, while the sum is 24.
Adding to 125100512421 its reverse (124215001521), we get a palindrome (249315513942).
The spelling of 125100512421 in words is "one hundred twenty-five billion, one hundred million, five hundred twelve thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •