Base | Representation |
---|---|
bin | 10010110110100001… |
… | …01010111000111111 |
3 | 222010100111122202120 |
4 | 21123100222320333 |
5 | 131211440444411 |
6 | 4352144454023 |
7 | 505544226453 |
oct | 113320527077 |
9 | 28110448676 |
10 | 10121031231 |
11 | 4324070623 |
12 | 1b6561a313 |
13 | c53ab589c |
14 | 6c026a663 |
15 | 3e3819106 |
hex | 25b42ae3f |
10121031231 has 8 divisors (see below), whose sum is σ = 13501103280. Its totient is φ = 6744156672.
The previous prime is 10121031223. The next prime is 10121031257. The reversal of 10121031231 is 13213012101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10121031231 - 23 = 10121031223 is a prime.
It is a super-2 number, since 2×101210312312 (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 10121031231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10121031211) 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, 791976 + ... + 804653.
It is an arithmetic number, because the mean of its divisors is an integer number (1687637910).
Almost surely, 210121031231 is an apocalyptic number.
10121031231 is a deficient number, since it is larger than the sum of its proper divisors (3380072049).
10121031231 is a wasteful number, since it uses less digits than its factorization.
10121031231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1598745.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 10121031231 its reverse (13213012101), we get a palindrome (23334043332).
The spelling of 10121031231 in words is "ten billion, one hundred twenty-one million, thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •