Base | Representation |
---|---|
bin | 11001000000111010100010… |
… | …110001010000001100000110 |
3 | 112102112020102102120002221102 |
4 | 121000322202301100030012 |
5 | 103404432204410440402 |
6 | 1025551424452220102 |
7 | 32113152023323124 |
oct | 3100724261201406 |
9 | 472466372502842 |
10 | 110014023140102 |
11 | 3206575a003984 |
12 | 1040955590a632 |
13 | 495037c622ab3 |
14 | 1d249c851c914 |
15 | cabab58b7102 |
hex | 640ea2c50306 |
110014023140102 has 8 divisors (see below), whose sum is σ = 165932753134512. Its totient is φ = 54703105428600.
The previous prime is 110014023140101. The next prime is 110014023140141. The reversal of 110014023140102 is 201041320410011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110014023140101) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 151953070274 + ... + 151953070997.
It is an arithmetic number, because the mean of its divisors is an integer number (20741594141814).
Almost surely, 2110014023140102 is an apocalyptic number.
110014023140102 is a deficient number, since it is larger than the sum of its proper divisors (55918729994410).
110014023140102 is a wasteful number, since it uses less digits than its factorization.
110014023140102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 303906141454.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 110014023140102 its reverse (201041320410011), we get a palindrome (311055343550113).
The spelling of 110014023140102 in words is "one hundred ten trillion, fourteen billion, twenty-three million, one hundred forty thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •