Base | Representation |
---|---|
bin | 1001100110001101010001… |
… | …0011100000011000100110 |
3 | 1101100202120010120000210020 |
4 | 2121203110103200120212 |
5 | 2340340444344442100 |
6 | 34235304514140010 |
7 | 2136233302245606 |
oct | 231432423403046 |
9 | 41322503500706 |
10 | 10552001562150 |
11 | 33a9095878864 |
12 | 122506bb81606 |
13 | 5b70849193c9 |
14 | 286a10826c06 |
15 | 134735edb5a0 |
hex | 998d44e0626 |
10552001562150 has 24 divisors (see below), whose sum is σ = 26168963874504. Its totient is φ = 2813867083200.
The previous prime is 10552001562101. The next prime is 10552001562163. The reversal of 10552001562150 is 5126510025501.
It is a super-2 number, since 2×105520015621502 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 35173338391 + ... + 35173338690.
It is an arithmetic number, because the mean of its divisors is an integer number (1090373494771).
Almost surely, 210552001562150 is an apocalyptic number.
10552001562150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10552001562150 is an abundant number, since it is smaller than the sum of its proper divisors (15616962312354).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10552001562150 is a wasteful number, since it uses less digits than its factorization.
10552001562150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70346677096 (or 70346677091 counting only the distinct ones).
The product of its (nonzero) digits is 15000, while the sum is 33.
Adding to 10552001562150 its reverse (5126510025501), we get a palindrome (15678511587651).
The spelling of 10552001562150 in words is "ten trillion, five hundred fifty-two billion, one million, five hundred sixty-two thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.189 sec. • engine limits •