Base | Representation |
---|---|
bin | 1001100110000110001110… |
… | …0011111101101011101010 |
3 | 1101100120200022100022100120 |
4 | 2121201203203331223222 |
5 | 2340323111133113200 |
6 | 34234353104344110 |
7 | 2136135363543153 |
oct | 231414343755352 |
9 | 41316608308316 |
10 | 10550110051050 |
11 | 33a83050a0549 |
12 | 1224822615036 |
13 | 5b6b42a9867b |
14 | 2868b152c92a |
15 | 134674e089a0 |
hex | 998638fdaea |
10550110051050 has 48 divisors (see below), whose sum is σ = 26169917152032. Its totient is φ = 2812755774400.
The previous prime is 10550110051037. The next prime is 10550110051067. The reversal of 10550110051050 is 5015001105501.
It is a super-2 number, since 2×105501100510502 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10550110051050.
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, 6888456 + ... + 8279555.
It is an arithmetic number, because the mean of its divisors is an integer number (545206607334).
Almost surely, 210550110051050 is an apocalyptic number.
10550110051050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10550110051050 is an abundant number, since it is smaller than the sum of its proper divisors (15619807100982).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10550110051050 is a wasteful number, since it uses less digits than its factorization.
10550110051050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15172663 (or 15172658 counting only the distinct ones).
The product of its (nonzero) digits is 625, while the sum is 24.
Adding to 10550110051050 its reverse (5015001105501), we get a palindrome (15565111156551).
The spelling of 10550110051050 in words is "ten trillion, five hundred fifty billion, one hundred ten million, fifty-one thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •