Base | Representation |
---|---|
bin | 11001000010011110010010… |
… | …110101111111101100110110 |
3 | 112102220110212220020221211201 |
4 | 121002132102311333230312 |
5 | 103413211033303131410 |
6 | 1030112540534523114 |
7 | 32123663155605352 |
oct | 3102362265775466 |
9 | 472813786227751 |
10 | 110121130130230 |
11 | 320a712211993a |
12 | 1042626780649a |
13 | 495a4bb65882b |
14 | 1d29c693ca462 |
15 | cae783a0183a |
hex | 642792d7fb36 |
110121130130230 has 64 divisors (see below), whose sum is σ = 205725690003456. Its totient is φ = 42395641488000.
The previous prime is 110121130130197. The next prime is 110121130130243. The reversal of 110121130130230 is 32031031121011.
It is a junction number, because it is equal to n+sod(n) for n = 110121130130198 and 110121130130207.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 291775924 + ... + 292153096.
It is an arithmetic number, because the mean of its divisors is an integer number (3214463906304).
Almost surely, 2110121130130230 is an apocalyptic number.
110121130130230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110121130130230 is a deficient number, since it is larger than the sum of its proper divisors (95604559873226).
110121130130230 is a wasteful number, since it uses less digits than its factorization.
110121130130230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 382333.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 110121130130230 its reverse (32031031121011), we get a palindrome (142152161251241).
The spelling of 110121130130230 in words is "one hundred ten trillion, one hundred twenty-one billion, one hundred thirty million, one hundred thirty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •