Base | Representation |
---|---|
bin | 10001111001100001110… |
… | …101101010001110111111 |
3 | 11100120211221221212110000 |
4 | 101321201311222032333 |
5 | 130123021014300411 |
6 | 2341015525445343 |
7 | 154602412241526 |
oct | 21714165521677 |
9 | 4316757855400 |
10 | 1230002103231 |
11 | 434706137330 |
12 | 17a471270853 |
13 | 8bcb1238205 |
14 | 43764d5d4bd |
15 | 21eddacc956 |
hex | 11e61d6a3bf |
1230002103231 has 80 divisors (see below), whose sum is σ = 2081075724288. Its totient is φ = 717236078400.
The previous prime is 1230002103229. The next prime is 1230002103233. The reversal of 1230002103231 is 1323012000321.
It is an interprime number because it is at equal distance from previous prime (1230002103229) and next prime (1230002103233).
It is not a de Polignac number, because 1230002103231 - 21 = 1230002103229 is a prime.
It is a super-2 number, since 2×12300021032312 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1230002103233) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 4649730 + ... + 4907136.
Almost surely, 21230002103231 is an apocalyptic number.
1230002103231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1230002103231 is a deficient number, since it is larger than the sum of its proper divisors (851073621057).
1230002103231 is a wasteful number, since it uses less digits than its factorization.
1230002103231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 257634 (or 257625 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 1230002103231 its reverse (1323012000321), we get a palindrome (2553014103552).
The spelling of 1230002103231 in words is "one trillion, two hundred thirty billion, two million, one hundred three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •