Base | Representation |
---|---|
bin | 10001111101010010100… |
… | …100111100011100010101 |
3 | 11100222021102220121221221 |
4 | 101331102210330130111 |
5 | 130204304000433141 |
6 | 2342524410010341 |
7 | 155104454454463 |
oct | 21752244743425 |
9 | 4328242817857 |
10 | 1234041030421 |
11 | 436398a99091 |
12 | 17b1b9a169b1 |
13 | 8c4a5c39064 |
14 | 43a29527833 |
15 | 22178491bd1 |
hex | 11f5293c715 |
1234041030421 has 4 divisors (see below), whose sum is σ = 1237933904652. Its totient is φ = 1230148156192.
The previous prime is 1234041030413. The next prime is 1234041030491. The reversal of 1234041030421 is 1240301404321.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 321614886321 + 912426144100 = 567111^2 + 955210^2 .
It is a cyclic number.
It is not a de Polignac number, because 1234041030421 - 23 = 1234041030413 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 (1234041030491) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1946436640 + ... + 1946437273.
It is an arithmetic number, because the mean of its divisors is an integer number (309483476163).
Almost surely, 21234041030421 is an apocalyptic number.
It is an amenable number.
1234041030421 is a deficient number, since it is larger than the sum of its proper divisors (3892874231).
1234041030421 is an equidigital number, since it uses as much as digits as its factorization.
1234041030421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3892874230.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 1234041030421 its reverse (1240301404321), we get a palindrome (2474342434742).
The spelling of 1234041030421 in words is "one trillion, two hundred thirty-four billion, forty-one million, thirty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •