Base | Representation |
---|---|
bin | 101111111110010100… |
… | …1100110100101110101 |
3 | 100211220211222021102000 |
4 | 1133330221212211311 |
5 | 3141442342342323 |
6 | 115154512405513 |
7 | 10305002104122 |
oct | 1377451464565 |
9 | 324824867360 |
10 | 103023012213 |
11 | 3a767893a00 |
12 | 17b72246899 |
13 | 993abc0474 |
14 | 4db4737749 |
15 | 2a2e826e43 |
hex | 17fca66975 |
103023012213 has 96 divisors (see below), whose sum is σ = 179779824000. Its totient is φ = 58054740480.
The previous prime is 103023012187. The next prime is 103023012271. The reversal of 103023012213 is 312210320301.
It is a de Polignac number, because none of the positive numbers 2k-103023012213 is a prime.
It is a super-2 number, since 2×1030230122132 (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 (103023010213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 4598563 + ... + 4620911.
It is an arithmetic number, because the mean of its divisors is an integer number (1872706500).
Almost surely, 2103023012213 is an apocalyptic number.
It is an amenable number.
103023012213 is a deficient number, since it is larger than the sum of its proper divisors (76756811787).
103023012213 is a wasteful number, since it uses less digits than its factorization.
103023012213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22480 (or 22463 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 103023012213 its reverse (312210320301), we get a palindrome (415233332514).
The spelling of 103023012213 in words is "one hundred three billion, twenty-three million, twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •