Base | Representation |
---|---|
bin | 1001010100010101110… |
… | …1001100000011000101 |
3 | 120022012012000021210112 |
4 | 2111011131030003011 |
5 | 10110320220210011 |
6 | 201312254002405 |
7 | 14364623432120 |
oct | 2250535140305 |
9 | 508165007715 |
10 | 160079069381 |
11 | 61986509160 |
12 | 270361a6405 |
13 | 1213176253a |
14 | 7a682173b7 |
15 | 426d8aa58b |
hex | 254574c0c5 |
160079069381 has 32 divisors (see below), whose sum is σ = 203820675840. Its totient is φ = 122113728000.
The previous prime is 160079069333. The next prime is 160079069407. The reversal of 160079069381 is 183960970061.
It is not a de Polignac number, because 160079069381 - 26 = 160079069317 is a prime.
It is a super-2 number, since 2×1600790693812 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (50) 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 a congruent number.
It is not an unprimeable number, because it can be changed into a prime (160079069681) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 576515 + ... + 807791.
It is an arithmetic number, because the mean of its divisors is an integer number (6369396120).
Almost surely, 2160079069381 is an apocalyptic number.
160079069381 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
160079069381 is a deficient number, since it is larger than the sum of its proper divisors (43741606459).
160079069381 is a wasteful number, since it uses less digits than its factorization.
160079069381 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 231485.
The product of its (nonzero) digits is 489888, while the sum is 50.
The spelling of 160079069381 in words is "one hundred sixty billion, seventy-nine million, sixty-nine thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •