Base | Representation |
---|---|
bin | 11101011001010111111… |
… | …10100111101001000110 |
3 | 10120120010110221222101120 |
4 | 32230223332213221012 |
5 | 113022043104301100 |
6 | 2052002443134410 |
7 | 132655052055414 |
oct | 16545376475106 |
9 | 3516113858346 |
10 | 1010055150150 |
11 | 35a3a8889042 |
12 | 143909514406 |
13 | 7432b525627 |
14 | 36c5ba442b4 |
15 | 1b4193ba0a0 |
hex | eb2bfa7a46 |
1010055150150 has 48 divisors (see below), whose sum is σ = 2546001332688. Its totient is φ = 264932496000.
The previous prime is 1010055150131. The next prime is 1010055150151. The reversal of 1010055150150 is 510515500101.
It is a super-2 number, since 2×10100551501502 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1010055150150.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010055150151) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 55185121 + ... + 55203420.
It is an arithmetic number, because the mean of its divisors is an integer number (53041694431).
Almost surely, 21010055150150 is an apocalyptic number.
1010055150150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1010055150150 is an abundant number, since it is smaller than the sum of its proper divisors (1535946182538).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010055150150 is a wasteful number, since it uses less digits than its factorization.
1010055150150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 110388617 (or 110388612 counting only the distinct ones).
The product of its (nonzero) digits is 625, while the sum is 24.
The spelling of 1010055150150 in words is "one trillion, ten billion, fifty-five million, one hundred fifty thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •