Base | Representation |
---|---|
bin | 11110110101000011… |
… | …101011100011100001 |
3 | 10011102222000202120022 |
4 | 132311003223203201 |
5 | 1020243204141001 |
6 | 23112415323225 |
7 | 2251210600541 |
oct | 366503534341 |
9 | 104388022508 |
10 | 33102412001 |
11 | 130474a309a |
12 | 64b9b20515 |
13 | 3177055c49 |
14 | 18604ad321 |
15 | cdb19c11b |
hex | 7b50eb8e1 |
33102412001 has 4 divisors (see below), whose sum is σ = 33168750000. Its totient is φ = 33036074004.
The previous prime is 33102411989. The next prime is 33102412039. The reversal of 33102412001 is 10021420133.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 10021420133 = 773 ⋅12964321.
It is a cyclic number.
It is not a de Polignac number, because 33102412001 - 234 = 15922542817 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (33102412081) 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, 33168251 + ... + 33169248.
It is an arithmetic number, because the mean of its divisors is an integer number (8292187500).
Almost surely, 233102412001 is an apocalyptic number.
It is an amenable number.
33102412001 is a deficient number, since it is larger than the sum of its proper divisors (66337999).
33102412001 is an equidigital number, since it uses as much as digits as its factorization.
33102412001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66337998.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 33102412001 its reverse (10021420133), we get a palindrome (43123832134).
The spelling of 33102412001 in words is "thirty-three billion, one hundred two million, four hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •