Base | Representation |
---|---|
bin | 11011111111111110001011… |
… | …010110011010011111010111 |
3 | 121011000101111110102121121111 |
4 | 123333332023112122133113 |
5 | 112120040032341033221 |
6 | 1113523134414355451 |
7 | 34636545615034606 |
oct | 3377761326323727 |
9 | 534011443377544 |
10 | 123143345252311 |
11 | 3626788806665a |
12 | 1198a0091bbb87 |
13 | 53934a18b62a7 |
14 | 225a25398da3d |
15 | e3839360bbe1 |
hex | 6fff8b59a7d7 |
123143345252311 has 16 divisors (see below), whose sum is σ = 127240471987200. Its totient is φ = 119054053647360.
The previous prime is 123143345252297. The next prime is 123143345252341. The reversal of 123143345252311 is 113252543341321.
It is a cyclic number.
It is not a de Polignac number, because 123143345252311 - 217 = 123143345121239 is a prime.
It is a super-2 number, since 2×1231433452523112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123143345252341) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 198276540 + ... + 198896638.
It is an arithmetic number, because the mean of its divisors is an integer number (7952529499200).
Almost surely, 2123143345252311 is an apocalyptic number.
123143345252311 is a deficient number, since it is larger than the sum of its proper divisors (4097126734889).
123143345252311 is a wasteful number, since it uses less digits than its factorization.
123143345252311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 626406.
The product of its digits is 259200, while the sum is 40.
Adding to 123143345252311 its reverse (113252543341321), we get a palindrome (236395888593632).
The spelling of 123143345252311 in words is "one hundred twenty-three trillion, one hundred forty-three billion, three hundred forty-five million, two hundred fifty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •