Base | Representation |
---|---|
bin | 100100010111011… |
… | …0100011101000111 |
3 | 10011001002021000222 |
4 | 1020232310131013 |
5 | 4444334424111 |
6 | 321025454555 |
7 | 42144544463 |
oct | 11056643507 |
9 | 3131067028 |
10 | 1220233031 |
11 | 576876156 |
12 | 2a07a145b |
13 | 165a599a4 |
14 | b80b94a3 |
15 | 721d57db |
hex | 48bb4747 |
1220233031 has 4 divisors (see below), whose sum is σ = 1225705152. Its totient is φ = 1214760912.
The previous prime is 1220232997. The next prime is 1220233037. The reversal of 1220233031 is 1303320221.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1303320221 = 7 ⋅186188603.
It is a cyclic number.
It is not a de Polignac number, because 1220233031 - 210 = 1220232007 is a prime.
It is a super-2 number, since 2×12202330312 = 2977937299886893922, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220233037) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2735726 + ... + 2736171.
It is an arithmetic number, because the mean of its divisors is an integer number (306426288).
Almost surely, 21220233031 is an apocalyptic number.
1220233031 is a deficient number, since it is larger than the sum of its proper divisors (5472121).
1220233031 is an equidigital number, since it uses as much as digits as its factorization.
1220233031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5472120.
The product of its (nonzero) digits is 216, while the sum is 17.
The square root of 1220233031 is about 34931.8340629289. The cubic root of 1220233031 is about 1068.5977587553.
Adding to 1220233031 its reverse (1303320221), we get a palindrome (2523553252).
The spelling of 1220233031 in words is "one billion, two hundred twenty million, two hundred thirty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •