Base | Representation |
---|---|
bin | 1001001110010010001110… |
… | …0011100100100010100011 |
3 | 1022220110201201112120121021 |
4 | 2103210203203210202203 |
5 | 2312122244131004443 |
6 | 33322415003110311 |
7 | 2064443534256601 |
oct | 223444343444243 |
9 | 38813651476537 |
10 | 10141014313123 |
11 | 325a864227671 |
12 | 1179491212397 |
13 | 5873a7bc94a5 |
14 | 270b83352871 |
15 | 128bcec219ed |
hex | 939238e48a3 |
10141014313123 has 8 divisors (see below), whose sum is σ = 10191081290400. Its totient is φ = 10091038951488.
The previous prime is 10141014313103. The next prime is 10141014313159. The reversal of 10141014313123 is 32131341014101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10141014313123 - 25 = 10141014313091 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10141014313103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22681978 + ... + 23124751.
It is an arithmetic number, because the mean of its divisors is an integer number (1273885161300).
Almost surely, 210141014313123 is an apocalyptic number.
10141014313123 is a deficient number, since it is larger than the sum of its proper divisors (50066977277).
10141014313123 is an equidigital number, since it uses as much as digits as its factorization.
10141014313123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45807821.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 10141014313123 its reverse (32131341014101), we get a palindrome (42272355327224).
The spelling of 10141014313123 in words is "ten trillion, one hundred forty-one billion, fourteen million, three hundred thirteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •