Base | Representation |
---|---|
bin | 111000010110011110… |
… | …0000000111110010111 |
3 | 102120100121100002001011 |
4 | 1300230330000332113 |
5 | 3440313312430143 |
6 | 131332000513051 |
7 | 11512546436140 |
oct | 1605474007627 |
9 | 376317302034 |
10 | 121013014423 |
11 | 47359767924 |
12 | 1b55301b787 |
13 | b5470301a2 |
14 | 5bddac0ac7 |
15 | 3233da7e9d |
hex | 1c2cf00f97 |
121013014423 has 8 divisors (see below), whose sum is σ = 138303015840. Its totient is φ = 103723620000.
The previous prime is 121013014403. The next prime is 121013014429. The reversal of 121013014423 is 324410310121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-121013014423 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121013014394 and 121013014403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121013014429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 418173 + ... + 645673.
It is an arithmetic number, because the mean of its divisors is an integer number (17287876980).
Almost surely, 2121013014423 is an apocalyptic number.
121013014423 is a deficient number, since it is larger than the sum of its proper divisors (17290001417).
121013014423 is an equidigital number, since it uses as much as digits as its factorization.
121013014423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 303497.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 121013014423 its reverse (324410310121), we get a palindrome (445423324544).
The spelling of 121013014423 in words is "one hundred twenty-one billion, thirteen million, fourteen thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •