Base | Representation |
---|---|
bin | 11011100001001101111111… |
… | …100010001101111100001101 |
3 | 120212112100122101222111022211 |
4 | 123201031333202031330031 |
5 | 111330423441404013123 |
6 | 1105224231450510421 |
7 | 34331062541154304 |
oct | 3341157742157415 |
9 | 525470571874284 |
10 | 121030023110413 |
11 | 356225a988834a |
12 | 116a8519a35411 |
13 | 526c10b7bc6b1 |
14 | 21c5c54a1943b |
15 | ded406a5d40d |
hex | 6e137f88df0d |
121030023110413 has 8 divisors (see below), whose sum is σ = 122523088363200. Its totient is φ = 119539917354528.
The previous prime is 121030023110387. The next prime is 121030023110429. The reversal of 121030023110413 is 314011320030121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121030023110413 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121030023110443) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 739791931 + ... + 739955512.
It is an arithmetic number, because the mean of its divisors is an integer number (15315386045400).
Almost surely, 2121030023110413 is an apocalyptic number.
It is an amenable number.
121030023110413 is a deficient number, since it is larger than the sum of its proper divisors (1493065252787).
121030023110413 is an equidigital number, since it uses as much as digits as its factorization.
121030023110413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1479748451.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 121030023110413 its reverse (314011320030121), we get a palindrome (435041343140534).
The spelling of 121030023110413 in words is "one hundred twenty-one trillion, thirty billion, twenty-three million, one hundred ten thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •