Base | Representation |
---|---|
bin | 11110000001000000001… |
… | …00011111111100111001 |
3 | 10122121001011201120010201 |
4 | 33000200010133330321 |
5 | 113344131012421101 |
6 | 2105441521242201 |
7 | 134340216033043 |
oct | 17004004377471 |
9 | 3577034646121 |
10 | 1031330201401 |
11 | 368426014a25 |
12 | 147a66493361 |
13 | 7633c111456 |
14 | 37cb93d4a93 |
15 | 1bc62048e01 |
hex | f02011ff39 |
1031330201401 has 4 divisors (see below), whose sum is σ = 1031371633552. Its totient is φ = 1031288769252.
The previous prime is 1031330201383. The next prime is 1031330201417. The reversal of 1031330201401 is 1041020331301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1031330201401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1031330201441) 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 in 3 ways as a sum of consecutive naturals, for example, 20678715 + ... + 20728528.
It is an arithmetic number, because the mean of its divisors is an integer number (257842908388).
Almost surely, 21031330201401 is an apocalyptic number.
It is an amenable number.
1031330201401 is a deficient number, since it is larger than the sum of its proper divisors (41432151).
1031330201401 is an equidigital number, since it uses as much as digits as its factorization.
1031330201401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41432150.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1031330201401 its reverse (1041020331301), we get a palindrome (2072350532702).
The spelling of 1031330201401 in words is "one trillion, thirty-one billion, three hundred thirty million, two hundred one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.085 sec. • engine limits •