Base | Representation |
---|---|
bin | 10011011010011111110… |
… | …000011000001100100011 |
3 | 11201112121010101012020220 |
4 | 103122133300120030203 |
5 | 133324234222333443 |
6 | 2500515240134123 |
7 | 165246511631226 |
oct | 23323760301443 |
9 | 4645533335226 |
10 | 1334120121123 |
11 | 4748850341a9 |
12 | 19668a167343 |
13 | 98a64c4b01a |
14 | 48800c955bd |
15 | 24a84600a83 |
hex | 1369fc18323 |
1334120121123 has 8 divisors (see below), whose sum is σ = 1786269619200. Its totient is φ = 885692018568.
The previous prime is 1334120121079. The next prime is 1334120121133. The reversal of 1334120121123 is 3211210214331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1334120121123 - 28 = 1334120120867 is a prime.
It is a super-2 number, since 2×13341201211232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1334120121093 and 1334120121102.
It is not an unprimeable number, because it can be changed into a prime (1334120121133) 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, 930348043 + ... + 930349476.
It is an arithmetic number, because the mean of its divisors is an integer number (223283702400).
Almost surely, 21334120121123 is an apocalyptic number.
1334120121123 is a deficient number, since it is larger than the sum of its proper divisors (452149498077).
1334120121123 is a wasteful number, since it uses less digits than its factorization.
1334120121123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1860697761.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 1334120121123 its reverse (3211210214331), we get a palindrome (4545330335454).
The spelling of 1334120121123 in words is "one trillion, three hundred thirty-four billion, one hundred twenty million, one hundred twenty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •