Base | Representation |
---|---|
bin | 111001010101100100… |
… | …1101111000101000001 |
3 | 102202211011211112112110 |
4 | 1302223021233011001 |
5 | 4004132404242403 |
6 | 132322042445533 |
7 | 11616201216132 |
oct | 1625311570501 |
9 | 382734745473 |
10 | 123130540353 |
11 | 48245a86457 |
12 | 1ba442038a9 |
13 | b7c3946302 |
14 | 5d6100dc89 |
15 | 3309c33103 |
hex | 1cab26f141 |
123130540353 has 8 divisors (see below), whose sum is σ = 166624413088. Its totient is φ = 80861847264.
The previous prime is 123130540343. The next prime is 123130540399. The reversal of 123130540353 is 353045031321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 123130540353 - 229 = 122593669441 is a prime.
It is a super-2 number, since 2×1231305403532 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 123130540353.
It is not an unprimeable number, because it can be changed into a prime (123130540343) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 306294676 + ... + 306295077.
It is an arithmetic number, because the mean of its divisors is an integer number (20828051636).
Almost surely, 2123130540353 is an apocalyptic number.
It is an amenable number.
123130540353 is a deficient number, since it is larger than the sum of its proper divisors (43493872735).
123130540353 is an equidigital number, since it uses as much as digits as its factorization.
123130540353 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 612589823.
The product of its (nonzero) digits is 16200, while the sum is 30.
Adding to 123130540353 its reverse (353045031321), we get a palindrome (476175571674).
The spelling of 123130540353 in words is "one hundred twenty-three billion, one hundred thirty million, five hundred forty thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •