Base | Representation |
---|---|
bin | 10010111010000000… |
… | …11111100000110100 |
3 | 222012101122221100200 |
4 | 21131000133200310 |
5 | 131241442013011 |
6 | 4355113040500 |
7 | 506351335566 |
oct | 113500374064 |
9 | 28171587320 |
10 | 10150344756 |
11 | 4339672282 |
12 | 1b733b6130 |
13 | c59baa276 |
14 | 6c40db336 |
15 | 3e61a9856 |
hex | 25d01f834 |
10150344756 has 72 divisors (see below), whose sum is σ = 26509636608. Its totient is φ = 3271320000.
The previous prime is 10150344727. The next prime is 10150344773. The reversal of 10150344756 is 65744305101.
10150344756 is a `hidden beast` number, since 1 + 0 + 150 + 34 + 475 + 6 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 10150344756.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1448421 + ... + 1455411.
Almost surely, 210150344756 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 10150344756, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13254818304).
10150344756 is an abundant number, since it is smaller than the sum of its proper divisors (16359291852).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10150344756 is a wasteful number, since it uses less digits than its factorization.
10150344756 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8333 (or 8328 counting only the distinct ones).
The product of its (nonzero) digits is 50400, while the sum is 36.
Adding to 10150344756 its reverse (65744305101), we get a palindrome (75894649857).
The spelling of 10150344756 in words is "ten billion, one hundred fifty million, three hundred forty-four thousand, seven hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •