Base | Representation |
---|---|
bin | 11110110110111101… |
… | …011110110100011001 |
3 | 10011112012002221110200 |
4 | 132312331132310121 |
5 | 1020324342411101 |
6 | 23115515532413 |
7 | 2252046153300 |
oct | 366675366431 |
9 | 104465087420 |
10 | 33134341401 |
11 | 13063521127 |
12 | 650875a109 |
13 | 3180855195 |
14 | 1864821437 |
15 | cddda7986 |
hex | 7b6f5ed19 |
33134341401 has 18 divisors (see below), whose sum is σ = 55674710442. Its totient is φ = 18933909120.
The previous prime is 33134341391. The next prime is 33134341421. The reversal of 33134341401 is 10414343133.
33134341401 is a `hidden beast` number, since 3 + 313 + 4 + 341 + 4 + 0 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 29335468176 + 3798873225 = 171276^2 + 61635^2 .
It is not a de Polignac number, because 33134341401 - 26 = 33134341337 is a prime.
It is not an unprimeable number, because it can be changed into a prime (33134341421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 37566840 + ... + 37567721.
It is an arithmetic number, because the mean of its divisors is an integer number (3093039469).
Almost surely, 233134341401 is an apocalyptic number.
It is an amenable number.
33134341401 is a deficient number, since it is larger than the sum of its proper divisors (22540369041).
33134341401 is a wasteful number, since it uses less digits than its factorization.
33134341401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75134581 (or 75134571 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 33134341401 its reverse (10414343133), we get a palindrome (43548684534).
The spelling of 33134341401 in words is "thirty-three billion, one hundred thirty-four million, three hundred forty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •