Base | Representation |
---|---|
bin | 1001101011101001010011… |
… | …0110011011101010000000 |
3 | 1101200200201001121020101111 |
4 | 2122322110312123222000 |
5 | 2343403313110202022 |
6 | 34350235153413104 |
7 | 2146051405120045 |
oct | 232722466335200 |
9 | 41620631536344 |
10 | 10645426256512 |
11 | 3434777661473 |
12 | 123b1a386a194 |
13 | 5c2b230cc548 |
14 | 28b3544bd1cc |
15 | 136da2d4c477 |
hex | 9ae94d9ba80 |
10645426256512 has 96 divisors (see below), whose sum is σ = 22387082721300. Its totient is φ = 5041566351360.
The previous prime is 10645426256461. The next prime is 10645426256533. The reversal of 10645426256512 is 21565262454601.
It can be written as a sum of positive squares in 2 ways, for example, as 9415225843776 + 1230200412736 = 3068424^2 + 1109144^2 .
It is a super-2 number, since 2×106454262565122 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 265260064 + ... + 265300192.
Almost surely, 210645426256512 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10645426256512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11193541360650).
10645426256512 is an abundant number, since it is smaller than the sum of its proper divisors (11741656464788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10645426256512 is an equidigital number, since it uses as much as digits as its factorization.
10645426256512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45922 (or 45891 counting only the distinct ones).
The product of its (nonzero) digits is 3456000, while the sum is 49.
The spelling of 10645426256512 in words is "ten trillion, six hundred forty-five billion, four hundred twenty-six million, two hundred fifty-six thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •