Base | Representation |
---|---|
bin | 111000011111000100… |
… | …0001010011001101001 |
3 | 102121002201000011100220 |
4 | 1300332020022121221 |
5 | 3441411130131213 |
6 | 131420342120253 |
7 | 11522650661556 |
oct | 1607610123151 |
9 | 377081004326 |
10 | 121301411433 |
11 | 47497536864 |
12 | 1b613720089 |
13 | b5919c78c7 |
14 | 5c2a113a2d |
15 | 324e373e23 |
hex | 1c3e20a669 |
121301411433 has 8 divisors (see below), whose sum is σ = 161866819200. Its totient is φ = 80801805648.
The previous prime is 121301411411. The next prime is 121301411437. The reversal of 121301411433 is 334114103121.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121301411433 - 218 = 121301149289 is a prime.
It is a super-2 number, since 2×1213014114332 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (121301411437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16446193 + ... + 16453566.
It is an arithmetic number, because the mean of its divisors is an integer number (20233352400).
Almost surely, 2121301411433 is an apocalyptic number.
It is an amenable number.
121301411433 is a deficient number, since it is larger than the sum of its proper divisors (40565407767).
121301411433 is a wasteful number, since it uses less digits than its factorization.
121301411433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32900991.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 121301411433 its reverse (334114103121), we get a palindrome (455415514554).
The spelling of 121301411433 in words is "one hundred twenty-one billion, three hundred one million, four hundred eleven thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •