Base | Representation |
---|---|
bin | 11001000010100110110001… |
… | …010000011110000100010000 |
3 | 112102221100101002212120100000 |
4 | 121002212301100132010100 |
5 | 103413333202430241144 |
6 | 1030121043535330000 |
7 | 32124434526136125 |
oct | 3102466120360420 |
9 | 472840332776300 |
10 | 110130230321424 |
11 | 320aaa71a22205 |
12 | 10427b87380900 |
13 | 495b30bab8651 |
14 | 1d2a48dc4274c |
15 | caeb178be769 |
hex | 6429b141e110 |
110130230321424 has 60 divisors (see below), whose sum is σ = 319626933896816. Its totient is φ = 36710076772512.
The previous prime is 110130230321357. The next prime is 110130230321459. The reversal of 110130230321424 is 424123032031011.
110130230321424 is a `hidden beast` number, since 1 + 1 + 0 + 1 + 3 + 0 + 230 + 3 + 2 + 1 + 424 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
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 11 ways as a sum of consecutive naturals, for example, 14162834374 + ... + 14162842149.
Almost surely, 2110130230321424 is an apocalyptic number.
It is an amenable number.
110130230321424 is an abundant number, since it is smaller than the sum of its proper divisors (209496703575392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110130230321424 is an equidigital number, since it uses as much as digits as its factorization.
110130230321424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28325676546 (or 28325676528 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 110130230321424 its reverse (424123032031011), we get a palindrome (534253262352435).
The spelling of 110130230321424 in words is "one hundred ten trillion, one hundred thirty billion, two hundred thirty million, three hundred twenty-one thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •