Base | Representation |
---|---|
bin | 10001011011000… |
… | …11101100010010 |
3 | 101012000201101020 |
4 | 20231203230102 |
5 | 244404113102 |
6 | 22300420310 |
7 | 3423225423 |
oct | 1055435422 |
9 | 335021336 |
10 | 146160402 |
11 | 7555a523 |
12 | 40b47696 |
13 | 2438635b |
14 | 155a964a |
15 | cc71bbc |
hex | 8b63b12 |
146160402 has 8 divisors (see below), whose sum is σ = 292320816. Its totient is φ = 48720132.
The previous prime is 146160401. The next prime is 146160403. The reversal of 146160402 is 204061641.
It is an interprime number because it is at equal distance from previous prime (146160401) and next prime (146160403).
It is a sphenic number, since it is the product of 3 distinct primes.
146160402 is an admirable number.
It is a super-2 number, since 2×1461604022 = 42725726225603208, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (146160401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12180028 + ... + 12180039.
It is an arithmetic number, because the mean of its divisors is an integer number (36540102).
Almost surely, 2146160402 is an apocalyptic number.
146160402 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146160402 is a wasteful number, since it uses less digits than its factorization.
146160402 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24360072.
The product of its (nonzero) digits is 1152, while the sum is 24.
The square root of 146160402 is about 12089.6816335253. The cubic root of 146160402 is about 526.7565075778.
The spelling of 146160402 in words is "one hundred forty-six million, one hundred sixty thousand, four hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •