Base | Representation |
---|---|
bin | 10011000001100011… |
… | …00101000100100111 |
3 | 222100210120210201222 |
4 | 21200301211010213 |
5 | 131404131403411 |
6 | 4405251410555 |
7 | 511046456612 |
oct | 114061450447 |
9 | 28323523658 |
10 | 10213544231 |
11 | 4371308a50 |
12 | 1b905b3a5b |
13 | c6a0075c7 |
14 | 6cc66d179 |
15 | 3eb9e04db |
hex | 260c65127 |
10213544231 has 8 divisors (see below), whose sum is σ = 11148992400. Its totient is φ = 9279253440.
The previous prime is 10213544213. The next prime is 10213544233. The reversal of 10213544231 is 13244531201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10213544231 is a prime.
It is a super-2 number, since 2×102135442312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10213544231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10213544233) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 270836 + ... + 306233.
It is an arithmetic number, because the mean of its divisors is an integer number (1393624050).
Almost surely, 210213544231 is an apocalyptic number.
10213544231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10213544231 is a deficient number, since it is larger than the sum of its proper divisors (935448169).
10213544231 is a wasteful number, since it uses less digits than its factorization.
10213544231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 578689.
The product of its (nonzero) digits is 2880, while the sum is 26.
The spelling of 10213544231 in words is "ten billion, two hundred thirteen million, five hundred forty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •