Base | Representation |
---|---|
bin | 111010001110011111… |
… | …1111110001100111001 |
3 | 102221202021220210010112 |
4 | 1310130333332030321 |
5 | 4022040342132411 |
6 | 133235353354105 |
7 | 12014423265032 |
oct | 1643477761471 |
9 | 387667823115 |
10 | 125040583481 |
11 | 490361710a0 |
12 | 20297a08935 |
13 | ba39585248 |
14 | 60a296da89 |
15 | 33bc776b8b |
hex | 1d1cffe339 |
125040583481 has 4 divisors (see below), whose sum is σ = 136407909264. Its totient is φ = 113673257700.
The previous prime is 125040583439. The next prime is 125040583483. The reversal of 125040583481 is 184385040521.
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 125040583481 - 218 = 125040321337 is a prime.
It is a super-2 number, since 2×1250405834812 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (125040583483) 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, 5683662875 + ... + 5683662896.
It is an arithmetic number, because the mean of its divisors is an integer number (34101977316).
Almost surely, 2125040583481 is an apocalyptic number.
125040583481 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
125040583481 is a deficient number, since it is larger than the sum of its proper divisors (11367325783).
125040583481 is a wasteful number, since it uses less digits than its factorization.
125040583481 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11367325782.
The product of its (nonzero) digits is 153600, while the sum is 41.
The spelling of 125040583481 in words is "one hundred twenty-five billion, forty million, five hundred eighty-three thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •