Base | Representation |
---|---|
bin | 1111001111001000001001… |
… | …11001010010001000000110 |
3 | 11101122001120120010101012211 |
4 | 13213210010321102020012 |
5 | 13342421442213021124 |
6 | 155132012432134034 |
7 | 10025444104665460 |
oct | 747440471221006 |
9 | 141561516111184 |
10 | 33505122001414 |
11 | a748495990748 |
12 | 391162569731a |
13 | 159069a2c368b |
14 | 83b929845130 |
15 | 3d1829b55e94 |
hex | 1e7904e52206 |
33505122001414 has 8 divisors (see below), whose sum is σ = 57437352002448. Its totient is φ = 14359338000600.
The previous prime is 33505122001411. The next prime is 33505122001469. The reversal of 33505122001414 is 41410022150533.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×335051220014142 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33505122001411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1196611500037 + ... + 1196611500064.
It is an arithmetic number, because the mean of its divisors is an integer number (7179669000306).
Almost surely, 233505122001414 is an apocalyptic number.
33505122001414 is a deficient number, since it is larger than the sum of its proper divisors (23932230001034).
33505122001414 is a wasteful number, since it uses less digits than its factorization.
33505122001414 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2393223000110.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 33505122001414 its reverse (41410022150533), we get a palindrome (74915144151947).
The spelling of 33505122001414 in words is "thirty-three trillion, five hundred five billion, one hundred twenty-two million, one thousand, four hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •