Base | Representation |
---|---|
bin | 111010100011000011… |
… | …0000111110001111001 |
3 | 110000112100021220001222 |
4 | 1311012012013301321 |
5 | 4024443343431213 |
6 | 133432023321425 |
7 | 12040464613604 |
oct | 1650606076171 |
9 | 400470256058 |
10 | 125730061433 |
11 | 4935a384089 |
12 | 2044a8b0275 |
13 | bb1937c272 |
14 | 612a36933b |
15 | 340d06b808 |
hex | 1d46187c79 |
125730061433 has 2 divisors, whose sum is σ = 125730061434. Its totient is φ = 125730061432.
The previous prime is 125730061417. The next prime is 125730061441. The reversal of 125730061433 is 334160037521.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 106296865024 + 19433196409 = 326032^2 + 139403^2 .
It is a cyclic number.
It is not a de Polignac number, because 125730061433 - 24 = 125730061417 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 125730061393 and 125730061402.
It is not a weakly prime, because it can be changed into another prime (125730061403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 62865030716 + 62865030717.
It is an arithmetic number, because the mean of its divisors is an integer number (62865030717).
Almost surely, 2125730061433 is an apocalyptic number.
It is an amenable number.
125730061433 is a deficient number, since it is larger than the sum of its proper divisors (1).
125730061433 is an equidigital number, since it uses as much as digits as its factorization.
125730061433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45360, while the sum is 35.
Adding to 125730061433 its reverse (334160037521), we get a palindrome (459890098954).
The spelling of 125730061433 in words is "one hundred twenty-five billion, seven hundred thirty million, sixty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •