Base | Representation |
---|---|
bin | 10001111011100001011… |
… | …101101011100110001011 |
3 | 11100210101011222222121012 |
4 | 101323201131223212023 |
5 | 130141412141113003 |
6 | 2342012215034135 |
7 | 155006442152606 |
oct | 21734135534613 |
9 | 4323334888535 |
10 | 1232143301003 |
11 | 43560485396a |
12 | 17a96a36b94b |
13 | 8c262a1bb44 |
14 | 438c949133d |
15 | 220b6a818d8 |
hex | 11ee176b98b |
1232143301003 has 2 divisors, whose sum is σ = 1232143301004. Its totient is φ = 1232143301002.
The previous prime is 1232143300981. The next prime is 1232143301023. The reversal of 1232143301003 is 3001033412321.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1232143301003 - 222 = 1232139106699 is a prime.
It is a super-2 number, since 2×12321433010032 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1232143301003.
It is not a weakly prime, because it can be changed into another prime (1232143301023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 616071650501 + 616071650502.
It is an arithmetic number, because the mean of its divisors is an integer number (616071650502).
Almost surely, 21232143301003 is an apocalyptic number.
1232143301003 is a deficient number, since it is larger than the sum of its proper divisors (1).
1232143301003 is an equidigital number, since it uses as much as digits as its factorization.
1232143301003 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 1232143301003 its reverse (3001033412321), we get a palindrome (4233176713324).
The spelling of 1232143301003 in words is "one trillion, two hundred thirty-two billion, one hundred forty-three million, three hundred one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •