Base | Representation |
---|---|
bin | 110010000011010001… |
… | …0001100000101100001 |
3 | 101021102201202011222101 |
4 | 1210012202030011201 |
5 | 3230111323324342 |
6 | 121213303010401 |
7 | 10523356203001 |
oct | 1440642140541 |
9 | 337381664871 |
10 | 107483808097 |
11 | 41646897976 |
12 | 189b8139a01 |
13 | a19c11b763 |
14 | 52b8d5a001 |
15 | 2be126e3b7 |
hex | 190688c161 |
107483808097 has 4 divisors (see below), whose sum is σ = 108488329776. Its totient is φ = 106479286420.
The previous prime is 107483808073. The next prime is 107483808143. The reversal of 107483808097 is 790808384701.
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 107483808097 - 27 = 107483807969 is a prime.
It is a super-2 number, since 2×1074838080972 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (107483808007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 502260679 + ... + 502260892.
It is an arithmetic number, because the mean of its divisors is an integer number (27122082444).
Almost surely, 2107483808097 is an apocalyptic number.
It is an amenable number.
107483808097 is a deficient number, since it is larger than the sum of its proper divisors (1004521679).
107483808097 is a wasteful number, since it uses less digits than its factorization.
107483808097 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1004521678.
The product of its (nonzero) digits is 2709504, while the sum is 55.
The spelling of 107483808097 in words is "one hundred seven billion, four hundred eighty-three million, eight hundred eight thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •