Base | Representation |
---|---|
bin | 111100010010001… |
… | …110010100110110 |
3 | 2121111010222000011 |
4 | 330102032110312 |
5 | 4032410111410 |
6 | 244210010434 |
7 | 34030562605 |
oct | 7422162466 |
9 | 2544128004 |
10 | 1011410230 |
11 | 479a07526 |
12 | 242876a1a |
13 | 1317038bc |
14 | 9847ba3c |
15 | 5dbd718a |
hex | 3c48e536 |
1011410230 has 8 divisors (see below), whose sum is σ = 1820538432. Its totient is φ = 404564088.
The previous prime is 1011410221. The next prime is 1011410233. The reversal of 1011410230 is 320141101.
1011410230 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1011410230.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011410233) 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, 50570502 + ... + 50570521.
It is an arithmetic number, because the mean of its divisors is an integer number (227567304).
Almost surely, 21011410230 is an apocalyptic number.
1011410230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1011410230 is a deficient number, since it is larger than the sum of its proper divisors (809128202).
1011410230 is a wasteful number, since it uses less digits than its factorization.
1011410230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101141030.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 1011410230 is about 31802.6764596944. The cubic root of 1011410230 is about 1003.7890350804.
Adding to 1011410230 its reverse (320141101), we get a palindrome (1331551331).
The spelling of 1011410230 in words is "one billion, eleven million, four hundred ten thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •