Base | Representation |
---|---|
bin | 111010010000011010… |
… | …1110111001001110001 |
3 | 102221220210012121122022 |
4 | 1310200311313021301 |
5 | 4022203342321113 |
6 | 133250015121225 |
7 | 12016135211606 |
oct | 1644065671161 |
9 | 387823177568 |
10 | 125105042033 |
11 | 49069597824 |
12 | 202b5513215 |
13 | ba49a336ba |
14 | 60ab34c6ad |
15 | 33c325a908 |
hex | 1d20d77271 |
125105042033 has 8 divisors (see below), whose sum is σ = 126893366400. Its totient is φ = 123321835728.
The previous prime is 125105042009. The next prime is 125105042053. The reversal of 125105042033 is 330240501521.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 125105042033 - 26 = 125105041969 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 125105041993 and 125105042011.
It is not an unprimeable number, because it can be changed into a prime (125105042003) 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 in 7 ways as a sum of consecutive naturals, for example, 1230266 + ... + 1328067.
It is an arithmetic number, because the mean of its divisors is an integer number (15861670800).
Almost surely, 2125105042033 is an apocalyptic number.
It is an amenable number.
125105042033 is a deficient number, since it is larger than the sum of its proper divisors (1788324367).
125105042033 is an equidigital number, since it uses as much as digits as its factorization.
125105042033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2559031.
The product of its (nonzero) digits is 3600, while the sum is 26.
Adding to 125105042033 its reverse (330240501521), we get a palindrome (455345543554).
The spelling of 125105042033 in words is "one hundred twenty-five billion, one hundred five million, forty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •