Base | Representation |
---|---|
bin | 100011000111101011001… |
… | …100101011011010010001 |
3 | 22112201110120110002022010 |
4 | 203013223030223122101 |
5 | 304020142142403403 |
6 | 5044413330333133 |
7 | 336235601545611 |
oct | 43075314533221 |
9 | 8481416402263 |
10 | 2413422622353 |
11 | 850588175006 |
12 | 32b8a242a1a9 |
13 | 14677a9a68b2 |
14 | 84b4b590a41 |
15 | 42ba2ea9603 |
hex | 231eb32b691 |
2413422622353 has 8 divisors (see below), whose sum is σ = 3407184878688. Its totient is φ = 1514304390464.
The previous prime is 2413422622307. The next prime is 2413422622361. The reversal of 2413422622353 is 3532262243142.
2413422622353 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 2413422622353 - 28 = 2413422622097 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2413422622363) 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, 23661006051 + ... + 23661006152.
It is an arithmetic number, because the mean of its divisors is an integer number (425898109836).
Almost surely, 22413422622353 is an apocalyptic number.
It is an amenable number.
2413422622353 is a deficient number, since it is larger than the sum of its proper divisors (993762256335).
2413422622353 is a wasteful number, since it uses less digits than its factorization.
2413422622353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47322012223.
The product of its digits is 414720, while the sum is 39.
Adding to 2413422622353 its reverse (3532262243142), we get a palindrome (5945684865495).
The spelling of 2413422622353 in words is "two trillion, four hundred thirteen billion, four hundred twenty-two million, six hundred twenty-two thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.256 sec. • engine limits •