Base | Representation |
---|---|
bin | 10010111001100001… |
… | …01011110100000000 |
3 | 222012002212101222000 |
4 | 21130300223310000 |
5 | 131234411411312 |
6 | 4354444144000 |
7 | 506301166305 |
oct | 113460536400 |
9 | 28162771860 |
10 | 10146200832 |
11 | 43372a1949 |
12 | 1b71b38000 |
13 | c59089041 |
14 | 6c373d0ac |
15 | 3e5b3badc |
hex | 25cc2bd00 |
10146200832 has 72 divisors (see below), whose sum is σ = 30004121280. Its totient is φ = 3382064640.
The previous prime is 10146200819. The next prime is 10146200851. The reversal of 10146200832 is 23800264101.
10146200832 is a `hidden beast` number, since 1 + 0 + 1 + 4 + 620 + 0 + 8 + 32 = 666.
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 10146200796 and 10146200805.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 727044 + ... + 740867.
Almost surely, 210146200832 is an apocalyptic number.
10146200832 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10146200832 is an abundant number, since it is smaller than the sum of its proper divisors (19857920448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10146200832 is an equidigital number, since it uses as much as digits as its factorization.
10146200832 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1467936 (or 1467916 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
Adding to 10146200832 its reverse (23800264101), we get a palindrome (33946464933).
The spelling of 10146200832 in words is "ten billion, one hundred forty-six million, two hundred thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •