Base | Representation |
---|---|
bin | 110001110101000011… |
… | …1011110101101011111 |
3 | 101020012111122002012102 |
4 | 1203222013132231133 |
5 | 3223122300410242 |
6 | 121054112155315 |
7 | 10505506604342 |
oct | 1435207365537 |
9 | 336174562172 |
10 | 107007044447 |
11 | 41421761326 |
12 | 188a4538b3b |
13 | a124410ba4 |
14 | 52718d2459 |
15 | 2bb4495e32 |
hex | 18ea1deb5f |
107007044447 has 4 divisors (see below), whose sum is σ = 107048994096. Its totient is φ = 106965094800.
The previous prime is 107007044399. The next prime is 107007044449. The reversal of 107007044447 is 744440700701.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 107007044447 - 26 = 107007044383 is a prime.
It is a super-2 number, since 2×1070070444472 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 107007044447.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107007044449) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20970998 + ... + 20976099.
It is an arithmetic number, because the mean of its divisors is an integer number (26762248524).
Almost surely, 2107007044447 is an apocalyptic number.
107007044447 is a deficient number, since it is larger than the sum of its proper divisors (41949649).
107007044447 is an equidigital number, since it uses as much as digits as its factorization.
107007044447 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41949648.
The product of its (nonzero) digits is 87808, while the sum is 38.
The spelling of 107007044447 in words is "one hundred seven billion, seven million, forty-four thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •