Base | Representation |
---|---|
bin | 100010100010111110… |
… | …100111010000111001 |
3 | 10112202011000112202022 |
4 | 202202332213100321 |
5 | 1101432034423423 |
6 | 25012450244225 |
7 | 2452140213524 |
oct | 424276472071 |
9 | 115664015668 |
10 | 37094061113 |
11 | 148056a315a |
12 | 7232886675 |
13 | 36620125b5 |
14 | 1b1c68bbbb |
15 | e71822dc8 |
hex | 8a2fa7439 |
37094061113 has 4 divisors (see below), whose sum is σ = 37094972160. Its totient is φ = 37093150068.
The previous prime is 37094061061. The next prime is 37094061139. The reversal of 37094061113 is 31116049073.
It is a happy number.
37094061113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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: 31116049073 = 251 ⋅123968323.
It is a cyclic number.
It is not a de Polignac number, because 37094061113 - 210 = 37094060089 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (37094064113) 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, 391445 + ... + 476882.
It is an arithmetic number, because the mean of its divisors is an integer number (9273743040).
Almost surely, 237094061113 is an apocalyptic number.
It is an amenable number.
37094061113 is a deficient number, since it is larger than the sum of its proper divisors (911047).
37094061113 is an equidigital number, since it uses as much as digits as its factorization.
37094061113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 911046.
The product of its (nonzero) digits is 13608, while the sum is 35.
The spelling of 37094061113 in words is "thirty-seven billion, ninety-four million, sixty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •