Base | Representation |
---|---|
bin | 11001000101100010101011… |
… | …110011001011110100010010 |
3 | 112110122122011221022002112212 |
4 | 121011202223303023310102 |
5 | 103430134420032040310 |
6 | 1030353453323352122 |
7 | 32145136604034101 |
oct | 3105425363136422 |
9 | 473578157262485 |
10 | 110332002221330 |
11 | 321785a29a4a9a |
12 | 1045b0b8382642 |
13 | 49743562395b6 |
14 | 1d361513a4038 |
15 | cb4ec669b205 |
hex | 6458abccbd12 |
110332002221330 has 32 divisors (see below), whose sum is σ = 198888238391040. Its totient is φ = 44068217546880.
The previous prime is 110332002221281. The next prime is 110332002221333. The reversal of 110332002221330 is 33122200233011.
It is a junction number, because it is equal to n+sod(n) for n = 110332002221296 and 110332002221305.
It is not an unprimeable number, because it can be changed into a prime (110332002221333) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 696773606 + ... + 696931934.
It is an arithmetic number, because the mean of its divisors is an integer number (6215257449720).
Almost surely, 2110332002221330 is an apocalyptic number.
110332002221330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110332002221330 is a deficient number, since it is larger than the sum of its proper divisors (88556236169710).
110332002221330 is a wasteful number, since it uses less digits than its factorization.
110332002221330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259874.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 110332002221330 its reverse (33122200233011), we get a palindrome (143454202454341).
The spelling of 110332002221330 in words is "one hundred ten trillion, three hundred thirty-two billion, two million, two hundred twenty-one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •