Base | Representation |
---|---|
bin | 101111111101101100… |
… | …1100110110000110001 |
3 | 100211212101111211211222 |
4 | 1133323121212300301 |
5 | 3141422010311033 |
6 | 115152443114425 |
7 | 10304325622526 |
oct | 1377331466061 |
9 | 324771454758 |
10 | 103002041393 |
11 | 3a756a70249 |
12 | 17b67212a15 |
13 | 993675a1b4 |
14 | 4db1a3914d |
15 | 2a2ca83598 |
hex | 17fb666c31 |
103002041393 has 4 divisors (see below), whose sum is σ = 103044979200. Its totient is φ = 102959103588.
The previous prime is 103002041377. The next prime is 103002041419. The reversal of 103002041393 is 393140200301.
It is a happy number.
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.
It is a cyclic number.
It is not a de Polignac number, because 103002041393 - 24 = 103002041377 is a prime.
It is a super-2 number, since 2×1030020413932 (a number of 23 digits) contains 22 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 (103002041333) 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, 21465305 + ... + 21470102.
It is an arithmetic number, because the mean of its divisors is an integer number (25761244800).
Almost surely, 2103002041393 is an apocalyptic number.
It is an amenable number.
103002041393 is a deficient number, since it is larger than the sum of its proper divisors (42937807).
103002041393 is an equidigital number, since it uses as much as digits as its factorization.
103002041393 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42937806.
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 103002041393 its reverse (393140200301), we get a palindrome (496142241694).
The spelling of 103002041393 in words is "one hundred three billion, two million, forty-one thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •