Base | Representation |
---|---|
bin | 10010111010000010… |
… | …11000010000111000 |
3 | 222012102002202020000 |
4 | 21131001120100320 |
5 | 131242021432313 |
6 | 4355122033000 |
7 | 506353324362 |
oct | 113501302070 |
9 | 28172082200 |
10 | 10150577208 |
11 | 4339810992 |
12 | 1b734a8760 |
13 | c59c5c005 |
14 | 6c415bd32 |
15 | 3e6203673 |
hex | 25d058438 |
10150577208 has 40 divisors (see below), whose sum is σ = 28431016680. Its totient is φ = 3383525520.
The previous prime is 10150577207. The next prime is 10150577273. The reversal of 10150577208 is 80277505101.
10150577208 is a `hidden beast` number, since 10 + 1 + 50 + 577 + 20 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10150577207) 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 9 ways as a sum of consecutive naturals, for example, 7831588 + ... + 7832883.
It is an arithmetic number, because the mean of its divisors is an integer number (710775417).
Almost surely, 210150577208 is an apocalyptic number.
10150577208 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
10150577208 is an abundant number, since it is smaller than the sum of its proper divisors (18280439472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10150577208 is a wasteful number, since it uses less digits than its factorization.
10150577208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15664489 (or 15664476 counting only the distinct ones).
The product of its (nonzero) digits is 19600, while the sum is 36.
The spelling of 10150577208 in words is "ten billion, one hundred fifty million, five hundred seventy-seven thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •