Base | Representation |
---|---|
bin | 100000000011110111011000… |
… | …010010100111111101100001 |
3 | 200111020202200011220111110111 |
4 | 200003313120102213331201 |
5 | 121440143332142340223 |
6 | 1215515533510131321 |
7 | 41462065341446146 |
oct | 4003673022477541 |
9 | 614222604814414 |
10 | 141003110121313 |
11 | 40a230a07a1330 |
12 | 13993420350b41 |
13 | 608a6c81390bb |
14 | 26b68308043cd |
15 | 1147c33cea30d |
hex | 803dd84a7f61 |
141003110121313 has 16 divisors (see below), whose sum is σ = 155527929910080. Its totient is φ = 126764733312000.
The previous prime is 141003110121241. The next prime is 141003110121323. The reversal of 141003110121313 is 313121011300141.
It is a cyclic number.
It is not a de Polignac number, because 141003110121313 - 213 = 141003110113121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (141003110121323) 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, 49884963 + ... + 52635688.
It is an arithmetic number, because the mean of its divisors is an integer number (9720495619380).
Almost surely, 2141003110121313 is an apocalyptic number.
It is an amenable number.
141003110121313 is a deficient number, since it is larger than the sum of its proper divisors (14524819788767).
141003110121313 is a wasteful number, since it uses less digits than its factorization.
141003110121313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102522048.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 141003110121313 its reverse (313121011300141), we get a palindrome (454124121421454).
The spelling of 141003110121313 in words is "one hundred forty-one trillion, three billion, one hundred ten million, one hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •