Base | Representation |
---|---|
bin | 1001000110010111110000… |
… | …0111011011100101001110 |
3 | 1022102110210220200120111010 |
4 | 2101211330013123211032 |
5 | 2302410331123431100 |
6 | 33140132303110050 |
7 | 2051561512426545 |
oct | 221457407334516 |
9 | 38373726616433 |
10 | 10005061155150 |
11 | 3208139210876 |
12 | 115706a8a2326 |
13 | 57761c879a99 |
14 | 26836738d15c |
15 | 1253c4429750 |
hex | 9197c1db94e |
10005061155150 has 48 divisors (see below), whose sum is σ = 24831891621504. Its totient is φ = 2665936742880.
The previous prime is 10005061155119. The next prime is 10005061155151. The reversal of 10005061155150 is 5155116050001.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10005061155151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 25801474 + ... + 26186373.
It is an arithmetic number, because the mean of its divisors is an integer number (517331075448).
Almost surely, 210005061155150 is an apocalyptic number.
10005061155150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10005061155150 is an abundant number, since it is smaller than the sum of its proper divisors (14826830466354).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10005061155150 is a wasteful number, since it uses less digits than its factorization.
10005061155150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51989145 (or 51989140 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 30.
The spelling of 10005061155150 in words is "ten trillion, five billion, sixty-one million, one hundred fifty-five thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •