Base | Representation |
---|---|
bin | 100100010111011… |
… | …0011101101111010 |
3 | 10011001002002220002 |
4 | 1020232303231322 |
5 | 4444334330020 |
6 | 321025433002 |
7 | 42144532616 |
oct | 11056635572 |
9 | 3131062802 |
10 | 1220230010 |
11 | 57687395a |
12 | 2a079b762 |
13 | 165a584bc |
14 | b80b8346 |
15 | 721d4975 |
hex | 48bb3b7a |
1220230010 has 8 divisors (see below), whose sum is σ = 2196414036. Its totient is φ = 488092000.
The previous prime is 1220230009. The next prime is 1220230019. The reversal of 1220230010 is 100320221.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 1109622721 + 110607289 = 33311^2 + 10517^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×12202300102 = 2977922554609200200, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1220229973 and 1220230000.
It is not an unprimeable number, because it can be changed into a prime (1220230019) 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, 61011491 + ... + 61011510.
Almost surely, 21220230010 is an apocalyptic number.
1220230010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1220230010 is a deficient number, since it is larger than the sum of its proper divisors (976184026).
1220230010 is a wasteful number, since it uses less digits than its factorization.
1220230010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 122023008.
The product of its (nonzero) digits is 24, while the sum is 11.
The square root of 1220230010 is about 34931.7908215425. The cubic root of 1220230010 is about 1068.5968768919.
Adding to 1220230010 its reverse (100320221), we get a palindrome (1320550231).
The spelling of 1220230010 in words is "one billion, two hundred twenty million, two hundred thirty thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •