Base | Representation |
---|---|
bin | 11110100100011010011… |
… | …01101111110000001110 |
3 | 10201102010002021220210220 |
4 | 33102031031233300032 |
5 | 114202044322224100 |
6 | 2122304201212210 |
7 | 135612301662330 |
oct | 17221515576016 |
9 | 3642102256726 |
10 | 1050341211150 |
11 | 3754a125aa30 |
12 | 14b691191066 |
13 | 7807b93524a |
14 | 38ba01d7450 |
15 | 1c4c605aaa0 |
hex | f48d36fc0e |
1050341211150 has 96 divisors (see below), whose sum is σ = 3247600497408. Its totient is φ = 218252716800.
The previous prime is 1050341211097. The next prime is 1050341211181. The reversal of 1050341211150 is 511121430501.
It is a super-2 number, since 2×10503412111502 (a number of 25 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 1050341211150.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 45457767 + ... + 45480866.
It is an arithmetic number, because the mean of its divisors is an integer number (33829171848).
Almost surely, 21050341211150 is an apocalyptic number.
1050341211150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1050341211150 is an abundant number, since it is smaller than the sum of its proper divisors (2197259286258).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1050341211150 is a wasteful number, since it uses less digits than its factorization.
1050341211150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90938666 (or 90938661 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 24.
Adding to 1050341211150 its reverse (511121430501), we get a palindrome (1561462641651).
The spelling of 1050341211150 in words is "one trillion, fifty billion, three hundred forty-one million, two hundred eleven thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •