Base | Representation |
---|---|
bin | 1100111011011010010001… |
… | …00010010101001010100100 |
3 | 10201122211210002101001210000 |
4 | 12131231020202111022210 |
5 | 12211242313001210424 |
6 | 140244214102501300 |
7 | 5662654061330100 |
oct | 635551042251244 |
9 | 121584702331700 |
10 | 28429605491364 |
11 | 9070a23161500 |
12 | 3231a21434830 |
13 | 12b2b91c4034c |
14 | 704000972900 |
15 | 3447bc8923c9 |
hex | 19db488952a4 |
28429605491364 has 405 divisors, whose sum is σ = 95053297145499. Its totient is φ = 7382393615520.
The previous prime is 28429605491347. The next prime is 28429605491383. The reversal of 28429605491364 is 46319450692482.
The square root of 28429605491364 is 5331942.
It is a perfect power (a square), and thus also a powerful number.
28429605491364 is a `hidden beast` number, since 2 + 8 + 4 + 2 + 9 + 605 + 4 + 9 + 13 + 6 + 4 = 666.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is an unprimeable number.
It is a polite number, since it can be written in 134 ways as a sum of consecutive naturals, for example, 7390069689 + ... + 7390073535.
Almost surely, 228429605491364 is an apocalyptic number.
28429605491364 is the 5331942-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 28429605491364
28429605491364 is an abundant number, since it is smaller than the sum of its proper divisors (66623691654135).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28429605491364 is an equidigital number, since it uses as much as digits as its factorization.
28429605491364 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7746 (or 3870 counting only the distinct ones).
The product of its (nonzero) digits is 89579520, while the sum is 63.
The spelling of 28429605491364 in words is "twenty-eight trillion, four hundred twenty-nine billion, six hundred five million, four hundred ninety-one thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •