Base | Representation |
---|---|
bin | 111010011000111101… |
… | …0000010010011001101 |
3 | 102222122201221111212212 |
4 | 1310301322002103031 |
5 | 4023300141131231 |
6 | 133334243440205 |
7 | 12026212610615 |
oct | 1646172022315 |
9 | 388581844785 |
10 | 125391348941 |
11 | 491a6169401 |
12 | 20375386065 |
13 | ba94148981 |
14 | 60d7399a45 |
15 | 33dd46242b |
hex | 1d31e824cd |
125391348941 has 4 divisors (see below), whose sum is σ = 125450247900. Its totient is φ = 125332449984.
The previous prime is 125391348937. The next prime is 125391348947. The reversal of 125391348941 is 149843193521.
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 64340351716 + 61050997225 = 253654^2 + 247085^2 .
It is a cyclic number.
It is not a de Polignac number, because 125391348941 - 22 = 125391348937 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 125391348941.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125391348947) 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, 29446286 + ... + 29450543.
It is an arithmetic number, because the mean of its divisors is an integer number (31362561975).
Almost surely, 2125391348941 is an apocalyptic number.
It is an amenable number.
125391348941 is a deficient number, since it is larger than the sum of its proper divisors (58898959).
125391348941 is an equidigital number, since it uses as much as digits as its factorization.
125391348941 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 58898958.
The product of its digits is 933120, while the sum is 50.
The spelling of 125391348941 in words is "one hundred twenty-five billion, three hundred ninety-one million, three hundred forty-eight thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •