Base | Representation |
---|---|
bin | 110000000001000000… |
… | …0111101011100101111 |
3 | 100212011010100012120100 |
4 | 1200002000331130233 |
5 | 3142133413134411 |
6 | 115211445522143 |
7 | 10310144135103 |
oct | 1400200753457 |
9 | 325133305510 |
10 | 103113021231 |
11 | 3a803681020 |
12 | 17b98413353 |
13 | 995374653c |
14 | 4dc2687903 |
15 | 2a376a6456 |
hex | 180203d72f |
103113021231 has 48 divisors (see below), whose sum is σ = 165735198720. Its totient is φ = 61253055360.
The previous prime is 103113021211. The next prime is 103113021233. The reversal of 103113021231 is 132120311301.
103113021231 is a `hidden beast` number, since 10 + 311 + 302 + 12 + 31 = 666.
It is not a de Polignac number, because 103113021231 - 27 = 103113021103 is a prime.
It is a super-2 number, since 2×1031130212312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103113021233) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 994155 + ... + 1092963.
It is an arithmetic number, because the mean of its divisors is an integer number (3452816640).
Almost surely, 2103113021231 is an apocalyptic number.
103113021231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
103113021231 is a deficient number, since it is larger than the sum of its proper divisors (62622177489).
103113021231 is a wasteful number, since it uses less digits than its factorization.
103113021231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 99036 (or 99033 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 103113021231 its reverse (132120311301), we get a palindrome (235233332532).
The spelling of 103113021231 in words is "one hundred three billion, one hundred thirteen million, twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •