Base | Representation |
---|---|
bin | 11100000010011101011111… |
… | …101010110101100001011101 |
3 | 121011121202001100000002020111 |
4 | 130002131133222311201131 |
5 | 112130340403220202003 |
6 | 1114133505225250021 |
7 | 34655113030535302 |
oct | 3402353752654135 |
9 | 534552040002214 |
10 | 123314411100253 |
11 | 363233912a209a |
12 | 119b71aa933911 |
13 | 53a66645c4219 |
14 | 2264640dd50a9 |
15 | e3ca567e3e6d |
hex | 70275fab585d |
123314411100253 has 8 divisors (see below), whose sum is σ = 123809057106336. Its totient is φ = 122819791710000.
The previous prime is 123314411100247. The next prime is 123314411100409. The reversal of 123314411100253 is 352001114413321.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 123314411100253 - 29 = 123314411099741 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123314411100053) 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, 2656950 + ... + 15927592.
It is an arithmetic number, because the mean of its divisors is an integer number (15476132138292).
Almost surely, 2123314411100253 is an apocalyptic number.
It is an amenable number.
123314411100253 is a deficient number, since it is larger than the sum of its proper divisors (494646006083).
123314411100253 is a wasteful number, since it uses less digits than its factorization.
123314411100253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13307915.
The product of its (nonzero) digits is 8640, while the sum is 31.
Adding to 123314411100253 its reverse (352001114413321), we get a palindrome (475315525513574).
The spelling of 123314411100253 in words is "one hundred twenty-three trillion, three hundred fourteen billion, four hundred eleven million, one hundred thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •