Base | Representation |
---|---|
bin | 1001011001000011101… |
… | …1011001100000011110 |
3 | 120102110102121110021020 |
4 | 2112100323121200132 |
5 | 10120413342430110 |
6 | 202042045145010 |
7 | 14441200152264 |
oct | 2262073314036 |
9 | 512412543236 |
10 | 161345280030 |
11 | 62476227a40 |
12 | 2732a25b166 |
13 | 122a3b997cc |
14 | 7b48460434 |
15 | 42e4b23d70 |
hex | 2590ed981e |
161345280030 has 32 divisors (see below), whose sum is σ = 422431279488. Its totient is φ = 39114007200.
The previous prime is 161345280023. The next prime is 161345280037. The reversal of 161345280030 is 30082543161.
It is an interprime number because it is at equal distance from previous prime (161345280023) and next prime (161345280037).
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 161345279973 and 161345280000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161345280037) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 244462216 + ... + 244462875.
It is an arithmetic number, because the mean of its divisors is an integer number (13200977484).
Almost surely, 2161345280030 is an apocalyptic number.
161345280030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
161345280030 is an abundant number, since it is smaller than the sum of its proper divisors (261085999458).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161345280030 is a wasteful number, since it uses less digits than its factorization.
161345280030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 488925112.
The product of its (nonzero) digits is 17280, while the sum is 33.
The spelling of 161345280030 in words is "one hundred sixty-one billion, three hundred forty-five million, two hundred eighty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •