Base | Representation |
---|---|
bin | 1011100011100011110000… |
… | …00000111101110001110110 |
3 | 10022222021100001221020201222 |
4 | 11301301320000331301312 |
5 | 11312313302222321402 |
6 | 130013400505150342 |
7 | 5231613155342531 |
oct | 561617000756166 |
9 | 108867301836658 |
10 | 25411040042102 |
11 | 8107841703a30 |
12 | 2a249b5a8b3b2 |
13 | 1124334cc0710 |
14 | 63bc880dba18 |
15 | 2e0eed2ee7a2 |
hex | 171c7803dc76 |
25411040042102 has 16 divisors (see below), whose sum is σ = 44780294340432. Its totient is φ = 10661974842720.
The previous prime is 25411040042093. The next prime is 25411040042119. The reversal of 25411040042102 is 20124004011452.
It is a super-2 number, since 2×254110400421022 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 44424894893 + ... + 44424895464.
It is an arithmetic number, because the mean of its divisors is an integer number (2798768396277).
Almost surely, 225411040042102 is an apocalyptic number.
25411040042102 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
25411040042102 is a deficient number, since it is larger than the sum of its proper divisors (19369254298330).
25411040042102 is a wasteful number, since it uses less digits than its factorization.
25411040042102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88849790383.
The product of its (nonzero) digits is 2560, while the sum is 26.
Adding to 25411040042102 its reverse (20124004011452), we get a palindrome (45535044053554).
The spelling of 25411040042102 in words is "twenty-five trillion, four hundred eleven billion, forty million, forty-two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •