Base | Representation |
---|---|
bin | 10011000001010111… |
… | …10001001111101111 |
3 | 222100200201102120120 |
4 | 21200223301033233 |
5 | 131403234134411 |
6 | 4405155020023 |
7 | 511030514436 |
oct | 114053611757 |
9 | 28320642516 |
10 | 10212021231 |
11 | 4370468775 |
12 | 1b8bb9a613 |
13 | c698c3319 |
14 | 6cc39411d |
15 | 3eb7de106 |
hex | 260af13ef |
10212021231 has 8 divisors (see below), whose sum is σ = 13699562880. Its totient is φ = 6766246872.
The previous prime is 10212021223. The next prime is 10212021251. The reversal of 10212021231 is 13212021201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10212021231 - 23 = 10212021223 is a prime.
It is a super-2 number, since 2×102120212312 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10212021231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10212021251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10441251 + ... + 10442228.
It is an arithmetic number, because the mean of its divisors is an integer number (1712445360).
Almost surely, 210212021231 is an apocalyptic number.
10212021231 is a deficient number, since it is larger than the sum of its proper divisors (3487541649).
10212021231 is a wasteful number, since it uses less digits than its factorization.
10212021231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20883645.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 10212021231 its reverse (13212021201), we get a palindrome (23424042432).
The spelling of 10212021231 in words is "ten billion, two hundred twelve million, twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •