Base | Representation |
---|---|
bin | 1100000111111011000000… |
… | …1111100111101001000010 |
3 | 1202012100200101002020201211 |
4 | 3001332300033213221002 |
5 | 3221400313020412114 |
6 | 44203454454320334 |
7 | 2544035532620221 |
oct | 301766017475102 |
9 | 52170611066654 |
10 | 13330240404034 |
11 | 427a36120a144 |
12 | 15b35a66590aa |
13 | 759061911b08 |
14 | 3412894b0cb8 |
15 | 181b3bb0a6c4 |
hex | c1fb03e7a42 |
13330240404034 has 4 divisors (see below), whose sum is σ = 19995360606054. Its totient is φ = 6665120202016.
The previous prime is 13330240403989. The next prime is 13330240404073. The reversal of 13330240404034 is 43040404203331.
13330240404034 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 9156403662025 + 4173836742009 = 3025955^2 + 2042997^2 .
It is a super-3 number, since 3×133302404040343 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13330240403987 and 13330240404005.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3332560101007 + ... + 3332560101010.
Almost surely, 213330240404034 is an apocalyptic number.
13330240404034 is a deficient number, since it is larger than the sum of its proper divisors (6665120202020).
13330240404034 is an equidigital number, since it uses as much as digits as its factorization.
13330240404034 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6665120202019.
The product of its (nonzero) digits is 41472, while the sum is 31.
Adding to 13330240404034 its reverse (43040404203331), we get a palindrome (56370644607365).
The spelling of 13330240404034 in words is "thirteen trillion, three hundred thirty billion, two hundred forty million, four hundred four thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.379 sec. • engine limits •