Base | Representation |
---|---|
bin | 10000001010111010011… |
… | …110111010111011010110 |
3 | 10221020021112201120110201 |
4 | 100022322132322323112 |
5 | 121201244414331410 |
6 | 2210254144211114 |
7 | 143166215052361 |
oct | 20127236727326 |
9 | 3836245646421 |
10 | 1111230230230 |
11 | 3992a754a1aa |
12 | 15b444909a9a |
13 | 80a33612913 |
14 | 3bad8b890d8 |
15 | 1dd8b86b83a |
hex | 102ba7baed6 |
1111230230230 has 32 divisors (see below), whose sum is σ = 2015433104256. Its totient is φ = 441121532544.
The previous prime is 1111230230183. The next prime is 1111230230273. The reversal of 1111230230230 is 320320321111.
It is a junction number, because it is equal to n+sod(n) for n = 1111230230198 and 1111230230207.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 71667 + ... + 1492513.
It is an arithmetic number, because the mean of its divisors is an integer number (62982284508).
Almost surely, 21111230230230 is an apocalyptic number.
1111230230230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1111230230230 is a deficient number, since it is larger than the sum of its proper divisors (904202874026).
1111230230230 is a wasteful number, since it uses less digits than its factorization.
1111230230230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1421448.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1111230230230 its reverse (320320321111), we get a palindrome (1431550551341).
The spelling of 1111230230230 in words is "one trillion, one hundred eleven billion, two hundred thirty million, two hundred thirty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •