Base | Representation |
---|---|
bin | 1001101011101001010011… |
… | …0110011011101010101000 |
3 | 1101200200201001121020102222 |
4 | 2122322110312123222220 |
5 | 2343403313110202202 |
6 | 34350235153413212 |
7 | 2146051405120133 |
oct | 232722466335250 |
9 | 41620631536388 |
10 | 10645426256552 |
11 | 34347776614aa |
12 | 123b1a386a208 |
13 | 5c2b230cc579 |
14 | 28b3544bd21a |
15 | 136da2d4c4a2 |
hex | 9ae94d9baa8 |
10645426256552 has 8 divisors (see below), whose sum is σ = 19960174231050. Its totient is φ = 5322713128272.
The previous prime is 10645426256537. The next prime is 10645426256581. The reversal of 10645426256552 is 25565262454601.
It can be written as a sum of positive squares in only one way, i.e., 8230093766596 + 2415332489956 = 2868814^2 + 1554134^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×106454262565522 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10645426256494 and 10645426256503.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 665339141027 + ... + 665339141042.
Almost surely, 210645426256552 is an apocalyptic number.
It is an amenable number.
10645426256552 is a deficient number, since it is larger than the sum of its proper divisors (9314747974498).
10645426256552 is a wasteful number, since it uses less digits than its factorization.
10645426256552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1330678282075 (or 1330678282071 counting only the distinct ones).
The product of its (nonzero) digits is 17280000, while the sum is 53.
The spelling of 10645426256552 in words is "ten trillion, six hundred forty-five billion, four hundred twenty-six million, two hundred fifty-six thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •