Base | Representation |
---|---|
bin | 10111011101111011010100… |
… | …001100010101011011001001 |
3 | 111112102221020112201021121002 |
4 | 113131323110030111123021 |
5 | 102012004401234014103 |
6 | 1003302433205424345 |
7 | 30511536155611064 |
oct | 2735732414253311 |
9 | 445387215637532 |
10 | 103211624126153 |
11 | 2a982893109084 |
12 | b6ab13010b0b5 |
13 | 4578a782b476a |
14 | 1b6b67d9238db |
15 | bdeb87c0d488 |
hex | 5dded43156c9 |
103211624126153 has 4 divisors (see below), whose sum is σ = 103964993645460. Its totient is φ = 102458254606848.
The previous prime is 103211624126003. The next prime is 103211624126179. The reversal of 103211624126153 is 351621426112301.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 39523690783369 + 63687933342784 = 6286787^2 + 7980472^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103211624126153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103211624126953) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 376684759448 + ... + 376684759721.
It is an arithmetic number, because the mean of its divisors is an integer number (25991248411365).
Almost surely, 2103211624126153 is an apocalyptic number.
It is an amenable number.
103211624126153 is a deficient number, since it is larger than the sum of its proper divisors (753369519307).
103211624126153 is an equidigital number, since it uses as much as digits as its factorization.
103211624126153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 753369519306.
The product of its (nonzero) digits is 51840, while the sum is 38.
The spelling of 103211624126153 in words is "one hundred three trillion, two hundred eleven billion, six hundred twenty-four million, one hundred twenty-six thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •