Base | Representation |
---|---|
bin | 111010010000111001… |
… | …1010111001011110111 |
3 | 102221221220112200212001 |
4 | 1310201303113023313 |
5 | 4022222004222043 |
6 | 133251352440131 |
7 | 12016422226522 |
oct | 1644163271367 |
9 | 387856480761 |
10 | 125121164023 |
11 | 490776a9489 |
12 | 202ba9a9047 |
13 | ba5018993b |
14 | 60ad547bb9 |
15 | 33c489274d |
hex | 1d21cd72f7 |
125121164023 has 4 divisors (see below), whose sum is σ = 125218992640. Its totient is φ = 125023335408.
The previous prime is 125121163991. The next prime is 125121164117. The reversal of 125121164023 is 320461121521.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 125121164023 - 25 = 125121163991 is a prime.
It is a super-3 number, since 3×1251211640233 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 125121163982 and 125121164000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125121164423) 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, 48912390 + ... + 48914947.
It is an arithmetic number, because the mean of its divisors is an integer number (31304748160).
Almost surely, 2125121164023 is an apocalyptic number.
125121164023 is a deficient number, since it is larger than the sum of its proper divisors (97828617).
125121164023 is an equidigital number, since it uses as much as digits as its factorization.
125121164023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 97828616.
The product of its (nonzero) digits is 2880, while the sum is 28.
Adding to 125121164023 its reverse (320461121521), we get a palindrome (445582285544).
The spelling of 125121164023 in words is "one hundred twenty-five billion, one hundred twenty-one million, one hundred sixty-four thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •