Base | Representation |
---|---|
bin | 1010111000111110111… |
… | …01101011000100100001 |
3 | 1022202211221112220011102 |
4 | 11130133131223010201 |
5 | 22112320121331131 |
6 | 443522302524145 |
7 | 36014530515305 |
oct | 5343735530441 |
9 | 1282757486142 |
10 | 374190027041 |
11 | 134769573736 |
12 | 6062b596655 |
13 | 2939436c7ac |
14 | 1417a415d05 |
15 | 9b00a7e1cb |
hex | 571f76b121 |
374190027041 has 4 divisors (see below), whose sum is σ = 379460309184. Its totient is φ = 368919744900.
The previous prime is 374190027019. The next prime is 374190027047. The reversal of 374190027041 is 140720091473.
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 374190027041 - 214 = 374190010657 is a prime.
It is a super-2 number, since 2×3741900270412 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 374190026986 and 374190027004.
It is not an unprimeable number, because it can be changed into a prime (374190027047) 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, 2635140965 + ... + 2635141106.
It is an arithmetic number, because the mean of its divisors is an integer number (94865077296).
Almost surely, 2374190027041 is an apocalyptic number.
It is an amenable number.
374190027041 is a deficient number, since it is larger than the sum of its proper divisors (5270282143).
374190027041 is an equidigital number, since it uses as much as digits as its factorization.
374190027041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5270282142.
The product of its (nonzero) digits is 42336, while the sum is 38.
The spelling of 374190027041 in words is "three hundred seventy-four billion, one hundred ninety million, twenty-seven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •