Base | Representation |
---|---|
bin | 11001000010100111110001… |
… | …000001110110111100110010 |
3 | 112102221110010200002201010001 |
4 | 121002213301001312330302 |
5 | 103413342400324424020 |
6 | 1030121342035300214 |
7 | 32124503200214650 |
oct | 3102476101667462 |
9 | 472843120081101 |
10 | 110131300233010 |
11 | 32100470956661 |
12 | 1042822574a66a |
13 | 495b44c663024 |
14 | 1d2a551d8bdd0 |
15 | caeb7b7b050a |
hex | 6429f1076f32 |
110131300233010 has 64 divisors (see below), whose sum is σ = 238516086631680. Its totient is φ = 35766529413120.
The previous prime is 110131300232969. The next prime is 110131300233037. The reversal of 110131300233010 is 10332003131011.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2452330 + ... + 15042490.
It is an arithmetic number, because the mean of its divisors is an integer number (3726813853620).
Almost surely, 2110131300233010 is an apocalyptic number.
110131300233010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110131300233010 is an abundant number, since it is smaller than the sum of its proper divisors (128384786398670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110131300233010 is a wasteful number, since it uses less digits than its factorization.
110131300233010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12596771.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 110131300233010 its reverse (10332003131011), we get a palindrome (120463303364021).
The spelling of 110131300233010 in words is "one hundred ten trillion, one hundred thirty-one billion, three hundred million, two hundred thirty-three thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •