Base | Representation |
---|---|
bin | 1011011011011010111110… |
… | …11101001101110100100001 |
3 | 10021222112200022121210220101 |
4 | 11231231133131031310201 |
5 | 11243223210004040301 |
6 | 125241121530342401 |
7 | 5202454613042311 |
oct | 555553735156441 |
9 | 107875608553811 |
10 | 25131455143201 |
11 | 800a210286310 |
12 | 299a78958aa01 |
13 | 1103b698676b4 |
14 | 62c524457441 |
15 | 2d8ad8054701 |
hex | 16db5f74dd21 |
25131455143201 has 4 divisors (see below), whose sum is σ = 27416132883504. Its totient is φ = 22846777402900.
The previous prime is 25131455143159. The next prime is 25131455143219. The reversal of 25131455143201 is 10234155413152.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 25131455143201 - 211 = 25131455141153 is a prime.
It is a super-2 number, since 2×251314551432012 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (25131455143241) 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, 1142338870135 + ... + 1142338870156.
It is an arithmetic number, because the mean of its divisors is an integer number (6854033220876).
Almost surely, 225131455143201 is an apocalyptic number.
It is an amenable number.
25131455143201 is a deficient number, since it is larger than the sum of its proper divisors (2284677740303).
25131455143201 is a wasteful number, since it uses less digits than its factorization.
25131455143201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2284677740302.
The product of its (nonzero) digits is 72000, while the sum is 37.
The spelling of 25131455143201 in words is "twenty-five trillion, one hundred thirty-one billion, four hundred fifty-five million, one hundred forty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •