Base | Representation |
---|---|
bin | 1100001000101000010110… |
… | …1011111010010010000111 |
3 | 1202020112002120202221001102 |
4 | 3002022011223322102013 |
5 | 3222100224243131043 |
6 | 44213230311050315 |
7 | 2544646250552636 |
oct | 302120553722207 |
9 | 52215076687042 |
10 | 13342411302023 |
11 | 4284537386a21 |
12 | 15b5a2267099b |
13 | 75a2512b15bb |
14 | 341ac1a9751d |
15 | 1821003876b8 |
hex | c2285afa487 |
13342411302023 has 8 divisors (see below), whose sum is σ = 13668200582400. Its totient is φ = 13016639384320.
The previous prime is 13342411302001. The next prime is 13342411302097. The reversal of 13342411302023 is 32020311424331.
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 13342411302023 - 222 = 13342407107719 is a prime.
It is a super-2 number, since 2×133424113020232 (a number of 27 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 (13342411302323) 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, 2778215 + ... + 5865432.
It is an arithmetic number, because the mean of its divisors is an integer number (1708525072800).
Almost surely, 213342411302023 is an apocalyptic number.
13342411302023 is a deficient number, since it is larger than the sum of its proper divisors (325789280377).
13342411302023 is an equidigital number, since it uses as much as digits as its factorization.
13342411302023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8681337.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 13342411302023 its reverse (32020311424331), we get a palindrome (45362722726354).
The spelling of 13342411302023 in words is "thirteen trillion, three hundred forty-two billion, four hundred eleven million, three hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •