Base | Representation |
---|---|
bin | 11011111111011000101110… |
… | …101001010100010100001001 |
3 | 121010212112201011011101022121 |
4 | 123333120232221110110021 |
5 | 112113410210104033001 |
6 | 1113452444414051241 |
7 | 34633623310306615 |
oct | 3377305651242411 |
9 | 533775634141277 |
10 | 123103135221001 |
11 | 362518235a3a21 |
12 | 11982266aa9b21 |
13 | 538c764176860 |
14 | 225831b54c345 |
15 | e372dd4886a1 |
hex | 6ff62ea54509 |
123103135221001 has 24 divisors (see below), whose sum is σ = 140831482216320. Its totient is φ = 106947995350272.
The previous prime is 123103135220987. The next prime is 123103135221067. The reversal of 123103135221001 is 100122531301321.
It is not a de Polignac number, because 123103135221001 - 29 = 123103135220489 is a prime.
It is a super-2 number, since 2×1231031352210012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (123103135221301) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 410787120 + ... + 411086686.
It is an arithmetic number, because the mean of its divisors is an integer number (5867978425680).
Almost surely, 2123103135221001 is an apocalyptic number.
It is an amenable number.
123103135221001 is a deficient number, since it is larger than the sum of its proper divisors (17728346995319).
123103135221001 is a wasteful number, since it uses less digits than its factorization.
123103135221001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 408993 (or 408976 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 25.
Adding to 123103135221001 its reverse (100122531301321), we get a palindrome (223225666522322).
The spelling of 123103135221001 in words is "one hundred twenty-three trillion, one hundred three billion, one hundred thirty-five million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •