Base | Representation |
---|---|
bin | 10100110010111000100011… |
… | …10111110100010101000001 |
3 | 12222220122001212010210120002 |
4 | 22121130101313310111001 |
5 | 21443210104030123231 |
6 | 241131310042525345 |
7 | 12426540464061026 |
oct | 1231342167642501 |
9 | 188818055123502 |
10 | 45728816645441 |
11 | 13630533937486 |
12 | 5166674206855 |
13 | 1c69293c76b47 |
14 | b4140237554d |
15 | 5447a12c10cb |
hex | 299711df4541 |
45728816645441 has 4 divisors (see below), whose sum is σ = 47717026064832. Its totient is φ = 43740607226052.
The previous prime is 45728816645399. The next prime is 45728816645459. The reversal of 45728816645441 is 14454661882754.
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 a cyclic number.
It is not a de Polignac number, because 45728816645441 - 226 = 45728749536577 is a prime.
It is a super-2 number, since 2×457288166454412 (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 (45728816642441) 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, 994104709661 + ... + 994104709706.
It is an arithmetic number, because the mean of its divisors is an integer number (11929256516208).
Almost surely, 245728816645441 is an apocalyptic number.
It is an amenable number.
45728816645441 is a deficient number, since it is larger than the sum of its proper divisors (1988209419391).
45728816645441 is a wasteful number, since it uses less digits than its factorization.
45728816645441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1988209419390.
The product of its digits is 206438400, while the sum is 65.
The spelling of 45728816645441 in words is "forty-five trillion, seven hundred twenty-eight billion, eight hundred sixteen million, six hundred forty-five thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •