Base | Representation |
---|---|
bin | 1011010111100110001010… |
… | …00000110111000111000010 |
3 | 10021111222102000210201012120 |
4 | 11223303011000313013002 |
5 | 11234100012320000002 |
6 | 125100503124105110 |
7 | 5160122451206610 |
oct | 553630500670702 |
9 | 107458360721176 |
10 | 25000015000002 |
11 | 7a694a079a299 |
12 | 2979206535196 |
13 | 10c46504ca633 |
14 | 6260159ca6b0 |
15 | 2d5493a6bcbc |
hex | 16bcc50371c2 |
25000015000002 has 128 divisors (see below), whose sum is σ = 61435208540160. Its totient is φ = 6622405205760.
The previous prime is 25000014999979. The next prime is 25000015000007. The reversal of 25000015000002 is 20000051000052.
It is not an unprimeable number, because it can be changed into a prime (25000015000007) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 704982552 + ... + 705018012.
It is an arithmetic number, because the mean of its divisors is an integer number (479962566720).
Almost surely, 225000015000002 is an apocalyptic number.
It is a pronic number, being equal to 5000001×5000002.
It is a practical number, because each smaller number is the sum of distinct divisors of 25000015000002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30717604270080).
25000015000002 is an abundant number, since it is smaller than the sum of its proper divisors (36435193540158).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25000015000002 is a wasteful number, since it uses less digits than its factorization.
25000015000002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54336.
The product of its (nonzero) digits is 100, while the sum is 15.
Adding to 25000015000002 its reverse (20000051000052), we get a palindrome (45000066000054).
The spelling of 25000015000002 in words is "twenty-five trillion, fifteen million, two", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.152 sec. • engine limits •