Base | Representation |
---|---|
bin | 10111011100100000100001… |
… | …110100110101001110101011 |
3 | 111112002121121212112110100022 |
4 | 113130200201310311032223 |
5 | 102003410230414340021 |
6 | 1003145552200431055 |
7 | 30501515400240665 |
oct | 2734404164651653 |
9 | 445077555473308 |
10 | 103114142340011 |
11 | 2a94550a197360 |
12 | b69426577848b |
13 | 456c8114108ba |
14 | 1b66a730d5535 |
15 | bdc37eaeb1ab |
hex | 5dc821d353ab |
103114142340011 has 8 divisors (see below), whose sum is σ = 112535598646848. Its totient is φ = 93700593261000.
The previous prime is 103114142340007. The next prime is 103114142340029. The reversal of 103114142340011 is 110043241411301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103114142340011 - 22 = 103114142340007 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103114142340071) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1976779685 + ... + 1976831846.
It is an arithmetic number, because the mean of its divisors is an integer number (14066949830856).
Almost surely, 2103114142340011 is an apocalyptic number.
103114142340011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
103114142340011 is a deficient number, since it is larger than the sum of its proper divisors (9421456306837).
103114142340011 is a wasteful number, since it uses less digits than its factorization.
103114142340011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3953613913.
The product of its (nonzero) digits is 1152, while the sum is 26.
Adding to 103114142340011 its reverse (110043241411301), we get a palindrome (213157383751312).
The spelling of 103114142340011 in words is "one hundred three trillion, one hundred fourteen billion, one hundred forty-two million, three hundred forty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •