Base | Representation |
---|---|
bin | 10010110100011111… |
… | …10100111100010001 |
3 | 222002011112001121222 |
4 | 21122033310330101 |
5 | 131143113024131 |
6 | 4350340254425 |
7 | 505246602164 |
oct | 113217647421 |
9 | 28064461558 |
10 | 10104033041 |
11 | 4315510633 |
12 | 1b5b9a1415 |
13 | c5041389b |
14 | 6bbcc3adb |
15 | 3e20ac87b |
hex | 25a3f4f11 |
10104033041 has 4 divisors (see below), whose sum is σ = 10104235584. Its totient is φ = 10103830500.
The previous prime is 10104032993. The next prime is 10104033061. The reversal of 10104033041 is 14033040101.
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: 14033040101 = 79 ⋅177633419.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10104033041 is a prime.
It is a super-3 number, since 3×101040330413 (a number of 31 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10104033061) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 32156 + ... + 145746.
It is an arithmetic number, because the mean of its divisors is an integer number (2526058896).
Almost surely, 210104033041 is an apocalyptic number.
It is an amenable number.
10104033041 is a deficient number, since it is larger than the sum of its proper divisors (202543).
10104033041 is an equidigital number, since it uses as much as digits as its factorization.
10104033041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 202542.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 10104033041 its reverse (14033040101), we get a palindrome (24137073142).
The spelling of 10104033041 in words is "ten billion, one hundred four million, thirty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •