Base | Representation |
---|---|
bin | 11101110101010100110… |
… | …10001101010010101000 |
3 | 10121222212021111222020011 |
4 | 32322222122031102220 |
5 | 113243311132311402 |
6 | 2102523455141304 |
7 | 134025654360001 |
oct | 16725232152250 |
9 | 3558767458204 |
10 | 1025061213352 |
11 | 3657a9371470 |
12 | 1467b6b14834 |
13 | 758803b5377 |
14 | 378829a61a8 |
15 | 1b9e69caed7 |
hex | eeaa68d4a8 |
1025061213352 has 16 divisors (see below), whose sum is σ = 2096716118400. Its totient is φ = 465936915120.
The previous prime is 1025061213313. The next prime is 1025061213359. The reversal of 1025061213352 is 2533121605201.
1025061213352 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×10250612133522 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1025061213359) 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, 5824211352 + ... + 5824211527.
It is an arithmetic number, because the mean of its divisors is an integer number (131044757400).
Almost surely, 21025061213352 is an apocalyptic number.
It is an amenable number.
1025061213352 is an abundant number, since it is smaller than the sum of its proper divisors (1071654905048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1025061213352 is a wasteful number, since it uses less digits than its factorization.
1025061213352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11648422896 (or 11648422892 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 31.
Adding to 1025061213352 its reverse (2533121605201), we get a palindrome (3558182818553).
The spelling of 1025061213352 in words is "one trillion, twenty-five billion, sixty-one million, two hundred thirteen thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •