Base | Representation |
---|---|
bin | 10011010101001001… |
… | …01100000100010001 |
3 | 222210020220211110022 |
4 | 21222210230010101 |
5 | 132223222442134 |
6 | 4433443113225 |
7 | 515114003405 |
oct | 115244540421 |
9 | 28706824408 |
10 | 10377937169 |
11 | 4446090886 |
12 | 2017672815 |
13 | c950a5732 |
14 | 706423105 |
15 | 40b16452e |
hex | 26a92c111 |
10377937169 has 8 divisors (see below), whose sum is σ = 10481814720. Its totient is φ = 10274187376.
The previous prime is 10377937151. The next prime is 10377937183. The reversal of 10377937169 is 96173977301.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10377937169 is a prime.
It is a super-2 number, since 2×103779371692 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10377937169.
It is not an unprimeable number, because it can be changed into a prime (10377937139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 135707 + ... + 197919.
It is an arithmetic number, because the mean of its divisors is an integer number (1310226840).
Almost surely, 210377937169 is an apocalyptic number.
It is an amenable number.
10377937169 is a deficient number, since it is larger than the sum of its proper divisors (103877551).
10377937169 is a wasteful number, since it uses less digits than its factorization.
10377937169 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63879.
The product of its (nonzero) digits is 1500282, while the sum is 53.
The spelling of 10377937169 in words is "ten billion, three hundred seventy-seven million, nine hundred thirty-seven thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •