Base | Representation |
---|---|
bin | 111100010001000… |
… | …110000011110110 |
3 | 2121110120220222012 |
4 | 330101012003312 |
5 | 4032321123410 |
6 | 244155404222 |
7 | 34025220620 |
oct | 7421060366 |
9 | 2543526865 |
10 | 1011114230 |
11 | 4798250a5 |
12 | 242753672 |
13 | 13162bc59 |
14 | 98401c10 |
15 | 5db79605 |
hex | 3c4460f6 |
1011114230 has 16 divisors (see below), whose sum is σ = 2080006560. Its totient is φ = 346667712.
The previous prime is 1011114227. The next prime is 1011114233. The reversal of 1011114230 is 324111101.
It is an interprime number because it is at equal distance from previous prime (1011114227) and next prime (1011114233).
It is a super-2 number, since 2×10111142302 = 2044703972216985800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011114233) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7222175 + ... + 7222314.
It is an arithmetic number, because the mean of its divisors is an integer number (130000410).
Almost surely, 21011114230 is an apocalyptic number.
1011114230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1011114230 is an abundant number, since it is smaller than the sum of its proper divisors (1068892330).
1011114230 is a wasteful number, since it uses less digits than its factorization.
1011114230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14444503.
The product of its (nonzero) digits is 24, while the sum is 14.
The square root of 1011114230 is about 31798.0224227860. The cubic root of 1011114230 is about 1003.6911023341.
Adding to 1011114230 its reverse (324111101), we get a palindrome (1335225331).
The spelling of 1011114230 in words is "one billion, eleven million, one hundred fourteen thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •