Base | Representation |
---|---|
bin | 1011011010101000011011… |
… | …00011110100110001111000 |
3 | 10021212221121121202202011112 |
4 | 11231110031203310301320 |
5 | 11242302112200341102 |
6 | 125220432244415452 |
7 | 5200504144366262 |
oct | 555241543646170 |
9 | 107787547682145 |
10 | 25104311340152 |
11 | 7aa9751313330 |
12 | 29954730a7588 |
13 | 1101432147785 |
14 | 62b0ab4a0b32 |
15 | 2d804a066252 |
hex | 16d50d8f4c78 |
25104311340152 has 64 divisors (see below), whose sum is σ = 51490796083200. Its totient is φ = 11379718944000.
The previous prime is 25104311340139. The next prime is 25104311340191.
25104311340152 is nontrivially palindromic in base 10.
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 15 ways as a sum of consecutive naturals, for example, 121225577 + ... + 121432487.
It is an arithmetic number, because the mean of its divisors is an integer number (804543688800).
Almost surely, 225104311340152 is an apocalyptic number.
25104311340152 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
25104311340152 is an abundant number, since it is smaller than the sum of its proper divisors (26386484743048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25104311340152 is a wasteful number, since it uses less digits than its factorization.
25104311340152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210708 (or 210704 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 32.
It can be divided in two parts, 2510431 and 1340152, that added together give a palindrome (3850583).
The spelling of 25104311340152 in words is "twenty-five trillion, one hundred four billion, three hundred eleven million, three hundred forty thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •