Base | Representation |
---|---|
bin | 10011100001010111101… |
… | …001001110101100101101 |
3 | 11202020122110100011202210 |
4 | 103201113221032230231 |
5 | 133434343024103003 |
6 | 2504135433241033 |
7 | 165630424514112 |
oct | 23412751165455 |
9 | 4666573304683 |
10 | 1341500222253 |
11 | 477a219a2434 |
12 | 197ba9863179 |
13 | 9966cc19179 |
14 | 48d010b6909 |
15 | 24d6749c503 |
hex | 13857a4eb2d |
1341500222253 has 8 divisors (see below), whose sum is σ = 1797655240000. Its totient is φ = 889839343008.
The previous prime is 1341500222221. The next prime is 1341500222261. The reversal of 1341500222253 is 3522220051431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1341500222253 - 25 = 1341500222221 is a prime.
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 1341500222253.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1341500222203) 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, 1123533928 + ... + 1123535121.
It is an arithmetic number, because the mean of its divisors is an integer number (224706905000).
Almost surely, 21341500222253 is an apocalyptic number.
It is an amenable number.
1341500222253 is a deficient number, since it is larger than the sum of its proper divisors (456155017747).
1341500222253 is a wasteful number, since it uses less digits than its factorization.
1341500222253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2247069251.
The product of its (nonzero) digits is 14400, while the sum is 30.
Adding to 1341500222253 its reverse (3522220051431), we get a palindrome (4863720273684).
The spelling of 1341500222253 in words is "one trillion, three hundred forty-one billion, five hundred million, two hundred twenty-two thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •