Base | Representation |
---|---|
bin | 1110011110010… |
… | …00101000100011 |
3 | 22110110011111220 |
4 | 13033020220203 |
5 | 222040024120 |
6 | 20014110123 |
7 | 3002644200 |
oct | 717105043 |
9 | 273404456 |
10 | 121408035 |
11 | 62593721 |
12 | 347ab343 |
13 | 1c1caa98 |
14 | 121a4ca7 |
15 | a9d2b40 |
hex | 73c8a23 |
121408035 has 24 divisors (see below), whose sum is σ = 225968976. Its totient is φ = 55500480.
The previous prime is 121407983. The next prime is 121408061. The reversal of 121408035 is 530804121.
It is not a de Polignac number, because 121408035 - 26 = 121407971 is a prime.
It is a super-2 number, since 2×1214080352 = 29479821925122450, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121407996 and 121408014.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 81856 + ... + 83325.
It is an arithmetic number, because the mean of its divisors is an integer number (9415374).
Almost surely, 2121408035 is an apocalyptic number.
121408035 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
121408035 is a deficient number, since it is larger than the sum of its proper divisors (104560941).
121408035 is a wasteful number, since it uses less digits than its factorization.
121408035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165203 (or 165196 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 24.
The square root of 121408035 is about 11018.5314357223. The cubic root of 121408035 is about 495.1640921132.
It can be divided in two parts, 121 and 408035, that added together give a triangular number (408156 = T903).
The spelling of 121408035 in words is "one hundred twenty-one million, four hundred eight thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •