Base | Representation |
---|---|
bin | 10100011010111011001… |
… | …101100000110001111111 |
3 | 11222011011101221100021101 |
4 | 110122323031200301333 |
5 | 140442424324020111 |
6 | 2552400041513531 |
7 | 203246042026543 |
oct | 24327315406177 |
9 | 4864141840241 |
10 | 1403300220031 |
11 | 4a1155432466 |
12 | 1a7b764a28a7 |
13 | a243b5653a8 |
14 | 4bcc4a41a23 |
15 | 26782c57bc1 |
hex | 146bb360c7f |
1403300220031 has 2 divisors, whose sum is σ = 1403300220032. Its totient is φ = 1403300220030.
The previous prime is 1403300220017. The next prime is 1403300220053. The reversal of 1403300220031 is 1300220033041.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1403300220031 - 225 = 1403266665599 is a prime.
It is a super-2 number, since 2×14033002200312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1403300219990 and 1403300220008.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1403300220131) 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, 701650110015 + 701650110016.
It is an arithmetic number, because the mean of its divisors is an integer number (701650110016).
Almost surely, 21403300220031 is an apocalyptic number.
1403300220031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1403300220031 is an equidigital number, since it uses as much as digits as its factorization.
1403300220031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 1403300220031 its reverse (1300220033041), we get a palindrome (2703520253072).
The spelling of 1403300220031 in words is "one trillion, four hundred three billion, three hundred million, two hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •