Base | Representation |
---|---|
bin | 1001101011111110111110… |
… | …0111110111100100011010 |
3 | 1101201020201111221222001220 |
4 | 2122333233213313210122 |
5 | 2344002221444221014 |
6 | 34353040342552510 |
7 | 2146345521213030 |
oct | 232775747674432 |
9 | 41636644858056 |
10 | 10651244132634 |
11 | 34371926a9956 |
12 | 1240348138736 |
13 | 5c353c52c7b1 |
14 | 28b747040550 |
15 | 1370e39ac6a9 |
hex | 9afef9f791a |
10651244132634 has 32 divisors (see below), whose sum is σ = 24345879384960. Its totient is φ = 3043190295552.
The previous prime is 10651244132623. The next prime is 10651244132657. The reversal of 10651244132634 is 43623144215601.
It is a super-2 number, since 2×106512441326342 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5368462 + ... + 7079750.
It is an arithmetic number, because the mean of its divisors is an integer number (760808730780).
Almost surely, 210651244132634 is an apocalyptic number.
10651244132634 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
10651244132634 is an abundant number, since it is smaller than the sum of its proper divisors (13694635252326).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10651244132634 is a wasteful number, since it uses less digits than its factorization.
10651244132634 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1859494.
The product of its (nonzero) digits is 414720, while the sum is 42.
The spelling of 10651244132634 in words is "ten trillion, six hundred fifty-one billion, two hundred forty-four million, one hundred thirty-two thousand, six hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •