Base | Representation |
---|---|
bin | 11110010101010011100… |
… | …01010010000001100111 |
3 | 10200122011211021200112002 |
4 | 33022221301102001213 |
5 | 114033441432312043 |
6 | 2114443301315515 |
7 | 135204303560465 |
oct | 17125161220147 |
9 | 3618154250462 |
10 | 1042230354023 |
11 | 372009955a21 |
12 | 149ba8a05b9b |
13 | 773884498c1 |
14 | 38630d13835 |
15 | 1c19de63bb8 |
hex | f2a9c52067 |
1042230354023 has 2 divisors, whose sum is σ = 1042230354024. Its totient is φ = 1042230354022.
The previous prime is 1042230353999. The next prime is 1042230354103. The reversal of 1042230354023 is 3204530322401.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (3204530322401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1042230354023 - 214 = 1042230337639 is a prime.
It is a super-2 number, since 2×10422303540232 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1042230314023) 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 as a sum of consecutive naturals, namely, 521115177011 + 521115177012.
It is an arithmetic number, because the mean of its divisors is an integer number (521115177012).
Almost surely, 21042230354023 is an apocalyptic number.
1042230354023 is a deficient number, since it is larger than the sum of its proper divisors (1).
1042230354023 is an equidigital number, since it uses as much as digits as its factorization.
1042230354023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17280, while the sum is 29.
Adding to 1042230354023 its reverse (3204530322401), we get a palindrome (4246760676424).
The spelling of 1042230354023 in words is "one trillion, forty-two billion, two hundred thirty million, three hundred fifty-four thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.829 sec. • engine limits •