Base | Representation |
---|---|
bin | 110000000000100010… |
… | …1100000110011010001 |
3 | 100212010001000110120011 |
4 | 1200001011200303101 |
5 | 3142120420444033 |
6 | 115210131514521 |
7 | 10306564521136 |
oct | 1400105406321 |
9 | 325101013504 |
10 | 103097437393 |
11 | 3a7a58a7715 |
12 | 17b93158a41 |
13 | 995044b232 |
14 | 4dc058c58d |
15 | 2a36128ccd |
hex | 1801160cd1 |
103097437393 has 4 divisors (see below), whose sum is σ = 104549514048. Its totient is φ = 101645360740.
The previous prime is 103097437379. The next prime is 103097437427. The reversal of 103097437393 is 393734790301.
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 a de Polignac number, because none of the positive numbers 2k-103097437393 is a prime.
It is a Smith number, since the sum of its digits (49) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103097437493) 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, 726038221 + ... + 726038362.
It is an arithmetic number, because the mean of its divisors is an integer number (26137378512).
Almost surely, 2103097437393 is an apocalyptic number.
It is an amenable number.
103097437393 is a deficient number, since it is larger than the sum of its proper divisors (1452076655).
103097437393 is an equidigital number, since it uses as much as digits as its factorization.
103097437393 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1452076654.
The product of its (nonzero) digits is 1285956, while the sum is 49.
The spelling of 103097437393 in words is "one hundred three billion, ninety-seven million, four hundred thirty-seven thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •