Base | Representation |
---|---|
bin | 100111110001010100111… |
… | …1111111010111110010101 |
3 | 201100112211110100212220221 |
4 | 1033202221333322332111 |
5 | 1204023432412203040 |
6 | 15343022520154341 |
7 | 1102623553464001 |
oct | 117425177727625 |
9 | 21315743325827 |
10 | 5466050506645 |
11 | 1818159014133 |
12 | 7434353089b1 |
13 | 3085a5830421 |
14 | 14c7b5bd7701 |
15 | 972b7b3074a |
hex | 4f8a9ffaf95 |
5466050506645 has 8 divisors (see below), whose sum is σ = 6575617868760. Its totient is φ = 4361935564800.
The previous prime is 5466050506639. The next prime is 5466050506667.
5466050506645 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 4 ways, for example, as 3649482971044 + 1816567535601 = 1910362^2 + 1347801^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5466050506645 - 25 = 5466050506613 is a prime.
It is a super-2 number, since 2×54660505066452 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5466050506592 and 5466050506601.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1363102860 + ... + 1363106869.
It is an arithmetic number, because the mean of its divisors is an integer number (821952233595).
Almost surely, 25466050506645 is an apocalyptic number.
It is an amenable number.
5466050506645 is a deficient number, since it is larger than the sum of its proper divisors (1109567362115).
5466050506645 is a wasteful number, since it uses less digits than its factorization.
5466050506645 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2726210135.
The product of its (nonzero) digits is 12960000, while the sum is 52.
The spelling of 5466050506645 in words is "five trillion, four hundred sixty-six billion, fifty million, five hundred six thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •