Base | Representation |
---|---|
bin | 100001000000001… |
… | …1110010000111111 |
3 | 2212011210202221211 |
4 | 1002000132100333 |
5 | 4231444421343 |
6 | 301515505251 |
7 | 36304626250 |
oct | 10200362077 |
9 | 2764722854 |
10 | 1107420223 |
11 | 519123228 |
12 | 26aa58227 |
13 | 14857b250 |
14 | a7110b27 |
15 | 6734e79d |
hex | 4201e43f |
1107420223 has 32 divisors (see below), whose sum is σ = 1411665920. Its totient is φ = 845095680.
The previous prime is 1107420217. The next prime is 1107420241. The reversal of 1107420223 is 3220247011.
It is not a de Polignac number, because 1107420223 - 29 = 1107419711 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1107420194 and 1107420203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1107420203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1288768 + ... + 1289626.
It is an arithmetic number, because the mean of its divisors is an integer number (44114560).
Almost surely, 21107420223 is an apocalyptic number.
1107420223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1107420223 is a deficient number, since it is larger than the sum of its proper divisors (304245697).
1107420223 is a wasteful number, since it uses less digits than its factorization.
1107420223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1367.
The product of its (nonzero) digits is 672, while the sum is 22.
The square root of 1107420223 is about 33277.9239586847. The cubic root of 1107420223 is about 1034.5960516885.
Adding to 1107420223 its reverse (3220247011), we get a palindrome (4327667234).
The spelling of 1107420223 in words is "one billion, one hundred seven million, four hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •