Base | Representation |
---|---|
bin | 1001101011111011100011… |
… | …1011000010111101010000 |
3 | 1101201011100120002222120212 |
4 | 2122332320323002331100 |
5 | 2343443332030210021 |
6 | 34352405321023252 |
7 | 2146314005554004 |
oct | 232767073027520 |
9 | 41634316088525 |
10 | 10650326413136 |
11 | 3436861674693 |
12 | 1240130924b28 |
13 | 5c34243709c7 |
14 | 28b69b1d0704 |
15 | 13708d13085b |
hex | 9afb8ec2f50 |
10650326413136 has 40 divisors (see below), whose sum is σ = 22060956026304. Its totient is φ = 4963258897920.
The previous prime is 10650326413121. The next prime is 10650326413159. The reversal of 10650326413136 is 63131462305601.
It is a super-2 number, since 2×106503264131362 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10650326413093 and 10650326413102.
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, 190047770 + ... + 190103801.
Almost surely, 210650326413136 is an apocalyptic number.
10650326413136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
10650326413136 is an abundant number, since it is smaller than the sum of its proper divisors (11410629613168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10650326413136 is a wasteful number, since it uses less digits than its factorization.
10650326413136 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 380151699 (or 380151693 counting only the distinct ones).
The product of its (nonzero) digits is 233280, while the sum is 41.
Adding to 10650326413136 its reverse (63131462305601), we get a palindrome (73781788718737).
The spelling of 10650326413136 in words is "ten trillion, six hundred fifty billion, three hundred twenty-six million, four hundred thirteen thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •