Base | Representation |
---|---|
bin | 11100100010100100101001… |
… | …001111000100000000010111 |
3 | 121110102200221001020211020101 |
4 | 130202210221033010000113 |
5 | 112423014213411240043 |
6 | 1122543334035314531 |
7 | 35303413100536426 |
oct | 3442445117040027 |
9 | 543380831224211 |
10 | 125521111040023 |
11 | 36aa4227942a86 |
12 | 120b29ba14ba47 |
13 | 550678926135a |
14 | 22dd37b6d52bd |
15 | e7a15b03d24d |
hex | 7229293c4017 |
125521111040023 has 12 divisors (see below), whose sum is σ = 126835501501408. Its totient is φ = 124218612564480.
The previous prime is 125521111040009. The next prime is 125521111040027. The reversal of 125521111040023 is 320040111125521.
It is not a de Polignac number, because 125521111040023 - 237 = 125383672086551 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 125521111039973 and 125521111040000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125521111040027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4414986 + ... + 16447927.
Almost surely, 2125521111040023 is an apocalyptic number.
125521111040023 is a deficient number, since it is larger than the sum of its proper divisors (1314390461385).
125521111040023 is an equidigital number, since it uses as much as digits as its factorization.
125521111040023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20863482 (or 20863333 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 28.
Adding to 125521111040023 its reverse (320040111125521), we get a palindrome (445561222165544).
The spelling of 125521111040023 in words is "one hundred twenty-five trillion, five hundred twenty-one billion, one hundred eleven million, forty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •