Base | Representation |
---|---|
bin | 10001000010010011… |
… | …11101010001110100 |
3 | 212121102011202010100 |
4 | 20201021331101310 |
5 | 122212411134022 |
6 | 4111322354100 |
7 | 442436233515 |
oct | 104111752164 |
9 | 25542152110 |
10 | 9146193012 |
11 | 3973873200 |
12 | 193305b930 |
13 | b29b48438 |
14 | 62a9cca0c |
15 | 387e581ac |
hex | 22127d474 |
9146193012 has 54 divisors (see below), whose sum is σ = 25412402834. Its totient is φ = 2771572320.
The previous prime is 9146192999. The next prime is 9146193019. The reversal of 9146193012 is 2103916419.
It is a happy number.
9146193012 is a `hidden beast` number, since 9 + 1 + 4 + 619 + 30 + 1 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 6210070416 + 2936122596 = 78804^2 + 54186^2 .
It is a super-2 number, since 2×91461930122 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (9146193019) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 1045483 + ... + 1054194.
Almost surely, 29146193012 is an apocalyptic number.
It is an amenable number.
9146193012 is an abundant number, since it is smaller than the sum of its proper divisors (16266209822).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
9146193012 is a wasteful number, since it uses less digits than its factorization.
9146193012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2099709 (or 2099693 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 36.
The square root of 9146193012 is about 95635.7308331985. The cubic root of 9146193012 is about 2091.2861151465.
The spelling of 9146193012 in words is "nine billion, one hundred forty-six million, one hundred ninety-three thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •