Base | Representation |
---|---|
bin | 10011000001100000… |
… | …00010111110100100 |
3 | 222100202211101120200 |
4 | 21200300002332210 |
5 | 131404031024221 |
6 | 4405235030500 |
7 | 511043164320 |
oct | 114060027644 |
9 | 28322741520 |
10 | 10213142436 |
11 | 4371064092 |
12 | 1b9043b430 |
13 | c69bc6763 |
14 | 6cc5a6980 |
15 | 3eb961426 |
hex | 260c02fa4 |
10213142436 has 72 divisors (see below), whose sum is σ = 29878168320. Its totient is φ = 2881097856.
The previous prime is 10213142413. The next prime is 10213142437. The reversal of 10213142436 is 63424131201.
It is a happy number.
10213142436 is a `hidden beast` number, since 1 + 0 + 213 + 14 + 2 + 436 = 666.
It is a super-3 number, since 3×102131424363 (a number of 31 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (10213142437) 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 23 ways as a sum of consecutive naturals, for example, 236601 + ... + 276416.
It is an arithmetic number, because the mean of its divisors is an integer number (414974560).
Almost surely, 210213142436 is an apocalyptic number.
It is an amenable number.
10213142436 is an abundant number, since it is smaller than the sum of its proper divisors (19665025884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10213142436 is a wasteful number, since it uses less digits than its factorization.
10213142436 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 513113 (or 513108 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 10213142436 its reverse (63424131201), we get a palindrome (73637273637).
The spelling of 10213142436 in words is "ten billion, two hundred thirteen million, one hundred forty-two thousand, four hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •