Base | Representation |
---|---|
bin | 110100110000111111… |
… | …1101011000010100100 |
3 | 101211110222211112212210 |
4 | 1221201333223002210 |
5 | 3324031141343022 |
6 | 124015543443420 |
7 | 11121002400042 |
oct | 1514177530244 |
9 | 354428745783 |
10 | 113313231012 |
11 | 44068401663 |
12 | 19b64456570 |
13 | a8baa62627 |
14 | 56ad245392 |
15 | 2e32e10a0c |
hex | 1a61feb0a4 |
113313231012 has 24 divisors (see below), whose sum is σ = 266327451936. Its totient is φ = 37495375168.
The previous prime is 113313231001. The next prime is 113313231029. The reversal of 113313231012 is 210132313311.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 113313231012.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34461018 + ... + 34464305.
It is an arithmetic number, because the mean of its divisors is an integer number (11096977164).
Almost surely, 2113313231012 is an apocalyptic number.
113313231012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
113313231012 is an abundant number, since it is smaller than the sum of its proper divisors (153014220924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113313231012 is a wasteful number, since it uses less digits than its factorization.
113313231012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68925467 (or 68925465 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 113313231012 its reverse (210132313311), we get a palindrome (323445544323).
The spelling of 113313231012 in words is "one hundred thirteen billion, three hundred thirteen million, two hundred thirty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •