Base | Representation |
---|---|
bin | 10000011101010100111… |
… | …000001011010001001010 |
3 | 11000010022100210211021220 |
4 | 100131110320023101022 |
5 | 122012242101124320 |
6 | 2223324023542510 |
7 | 144466146606105 |
oct | 20352470132112 |
9 | 4003270724256 |
10 | 1131000411210 |
11 | 3a672227984a |
12 | 1632418baa36 |
13 | 828644c2767 |
14 | 3ca5272973c |
15 | 1e64733ce40 |
hex | 10754e0b44a |
1131000411210 has 16 divisors (see below), whose sum is σ = 2714400986976. Its totient is φ = 301600109648.
The previous prime is 1131000411199. The next prime is 1131000411241. The reversal of 1131000411210 is 121140001311.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1131000411210.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18850006824 + ... + 18850006883.
It is an arithmetic number, because the mean of its divisors is an integer number (169650061686).
Almost surely, 21131000411210 is an apocalyptic number.
1131000411210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1131000411210 is an abundant number, since it is smaller than the sum of its proper divisors (1583400575766).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1131000411210 is a wasteful number, since it uses less digits than its factorization.
1131000411210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37700013717.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 1131000411210 its reverse (121140001311), we get a palindrome (1252140412521).
The spelling of 1131000411210 in words is "one trillion, one hundred thirty-one billion, four hundred eleven thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •