Base | Representation |
---|---|
bin | 111010010000100110… |
… | …1101111000001111111 |
3 | 102221221012222120021010 |
4 | 1310201031233001333 |
5 | 4022211443101343 |
6 | 133250401210303 |
7 | 12016242335220 |
oct | 1644115570177 |
9 | 387835876233 |
10 | 125111300223 |
11 | 49072081688 |
12 | 202b7630993 |
13 | ba4b115080 |
14 | 60ac0db247 |
15 | 33c3a94d33 |
hex | 1d2136f07f |
125111300223 has 16 divisors (see below), whose sum is σ = 205310852096. Its totient is φ = 65992773600.
The previous prime is 125111300221. The next prime is 125111300257. The reversal of 125111300223 is 322003111521.
It is not a de Polignac number, because 125111300223 - 21 = 125111300221 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 125111300223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125111300221) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 229141303 + ... + 229141848.
It is an arithmetic number, because the mean of its divisors is an integer number (12831928256).
Almost surely, 2125111300223 is an apocalyptic number.
125111300223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
125111300223 is a deficient number, since it is larger than the sum of its proper divisors (80199551873).
125111300223 is a wasteful number, since it uses less digits than its factorization.
125111300223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 458283174.
The product of its (nonzero) digits is 360, while the sum is 21.
Adding to 125111300223 its reverse (322003111521), we get a palindrome (447114411744).
The spelling of 125111300223 in words is "one hundred twenty-five billion, one hundred eleven million, three hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •