Base | Representation |
---|---|
bin | 1011100011100110010011… |
… | …11010111110101000000111 |
3 | 10022222101212211122221001202 |
4 | 11301303021322332220013 |
5 | 11312324111014020143 |
6 | 130014145114213115 |
7 | 5231662212463631 |
oct | 561631172765007 |
9 | 108871784587052 |
10 | 25412414204423 |
11 | 8108387355474 |
12 | 2a2511a12419b |
13 | 11244c38c390c |
14 | 63bd78805a51 |
15 | 2e107dc8dab8 |
hex | 171cc9ebea07 |
25412414204423 has 8 divisors (see below), whose sum is σ = 25891968800448. Its totient is φ = 24932862389344.
The previous prime is 25412414204399. The next prime is 25412414204483. The reversal of 25412414204423 is 32440241421452.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 25412414204423 - 28 = 25412414204167 is a prime.
It is a super-3 number, since 3×254124142044233 (a number of 41 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25412414204483) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33184361 + ... + 33941517.
It is an arithmetic number, because the mean of its divisors is an integer number (3236496100056).
Almost surely, 225412414204423 is an apocalyptic number.
25412414204423 is a deficient number, since it is larger than the sum of its proper divisors (479554596025).
25412414204423 is an equidigital number, since it uses as much as digits as its factorization.
25412414204423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1390473.
The product of its (nonzero) digits is 245760, while the sum is 38.
Adding to 25412414204423 its reverse (32440241421452), we get a palindrome (57852655625875).
The spelling of 25412414204423 in words is "twenty-five trillion, four hundred twelve billion, four hundred fourteen million, two hundred four thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •