Base | Representation |
---|---|
bin | 11001000010110001000001… |
… | …011111111000000111111010 |
3 | 112102222101210101221001122111 |
4 | 121002301001133320013322 |
5 | 103414023224443322020 |
6 | 1030130104235442534 |
7 | 32125304415523255 |
oct | 3102610137700772 |
9 | 472871711831574 |
10 | 110141240214010 |
11 | 321047017a7495 |
12 | 1042a13a5b644a |
13 | 495c374a979a5 |
14 | 1d2ac1616a09c |
15 | cb005e264d5a |
hex | 642c417f81fa |
110141240214010 has 64 divisors (see below), whose sum is σ = 204789550095360. Its totient is φ = 42606158031360.
The previous prime is 110141240214001. The next prime is 110141240214013. The reversal of 110141240214010 is 10412042141011.
It is not an unprimeable number, because it can be changed into a prime (110141240214013) 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 31 ways as a sum of consecutive naturals, for example, 3123050397 + ... + 3123085663.
It is an arithmetic number, because the mean of its divisors is an integer number (3199836720240).
Almost surely, 2110141240214010 is an apocalyptic number.
110141240214010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110141240214010 is a deficient number, since it is larger than the sum of its proper divisors (94648309881350).
110141240214010 is a wasteful number, since it uses less digits than its factorization.
110141240214010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41911.
The product of its (nonzero) digits is 256, while the sum is 22.
Adding to 110141240214010 its reverse (10412042141011), we get a palindrome (120553282355021).
The spelling of 110141240214010 in words is "one hundred ten trillion, one hundred forty-one billion, two hundred forty million, two hundred fourteen thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.223 sec. • engine limits •