Base | Representation |
---|---|
bin | 11100100001100110010001… |
… | …101111111011100111000001 |
3 | 121110012022002001212000220101 |
4 | 130201212101233323213001 |
5 | 112420420042110310423 |
6 | 1122452501045042401 |
7 | 35265522443634553 |
oct | 3441462157734701 |
9 | 543168061760811 |
10 | 125454145010113 |
11 | 36a78893303607 |
12 | 120a1a2b3b6401 |
13 | 550037656329a |
14 | 22da027a094d3 |
15 | e7853be817ad |
hex | 721991bfb9c1 |
125454145010113 has 4 divisors (see below), whose sum is σ = 125455669314480. Its totient is φ = 125452620705748.
The previous prime is 125454145010111. The next prime is 125454145010197. The reversal of 125454145010113 is 311010541454521.
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 125454145010113 - 21 = 125454145010111 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (125454145010111) 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, 762028723 + ... + 762193336.
It is an arithmetic number, because the mean of its divisors is an integer number (31363917328620).
Almost surely, 2125454145010113 is an apocalyptic number.
It is an amenable number.
125454145010113 is a deficient number, since it is larger than the sum of its proper divisors (1524304367).
125454145010113 is an equidigital number, since it uses as much as digits as its factorization.
125454145010113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1524304366.
The product of its (nonzero) digits is 48000, while the sum is 37.
Adding to 125454145010113 its reverse (311010541454521), we get a palindrome (436464686464634).
The spelling of 125454145010113 in words is "one hundred twenty-five trillion, four hundred fifty-four billion, one hundred forty-five million, ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •