Base | Representation |
---|---|
bin | 10001101001101110010… |
… | …101111100010010100011 |
3 | 11021222001021202111000111 |
4 | 101221232111330102203 |
5 | 124333242144220303 |
6 | 2325131554032151 |
7 | 153432031033540 |
oct | 21515625742243 |
9 | 4258037674014 |
10 | 1213032023203 |
11 | 428497a54000 |
12 | 177115b78657 |
13 | 8a5084bc540 |
14 | 429d522bbc7 |
15 | 21848d65b6d |
hex | 11a6e57c4a3 |
1213032023203 has 32 divisors (see below), whose sum is σ = 1642146734592. Its totient is φ = 872510459040.
The previous prime is 1213032023197. The next prime is 1213032023209. The reversal of 1213032023203 is 3023202303121.
It is an interprime number because it is at equal distance from previous prime (1213032023197) and next prime (1213032023209).
It is not a de Polignac number, because 1213032023203 - 25 = 1213032023171 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1213032023209) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4886401 + ... + 5128642.
It is an arithmetic number, because the mean of its divisors is an integer number (51317085456).
Almost surely, 21213032023203 is an apocalyptic number.
1213032023203 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1213032023203 is a deficient number, since it is larger than the sum of its proper divisors (429114711389).
1213032023203 is a wasteful number, since it uses less digits than its factorization.
1213032023203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10015096 (or 10015074 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 1213032023203 its reverse (3023202303121), we get a palindrome (4236234326324).
The spelling of 1213032023203 in words is "one trillion, two hundred thirteen billion, thirty-two million, twenty-three thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •