Base | Representation |
---|---|
bin | 111010100000001110010… |
… | …110101001100111010101 |
3 | 112020100011201120020222202 |
4 | 322200032112221213111 |
5 | 1011332114013121301 |
6 | 12314525244534245 |
7 | 563313346631513 |
oct | 72401626514725 |
9 | 15210151506882 |
10 | 4020330207701 |
11 | 1310015657615 |
12 | 54b200551385 |
13 | 232166a19832 |
14 | dc82941d4b3 |
15 | 6e8a0c0066b |
hex | 3a80e5a99d5 |
4020330207701 has 2 divisors, whose sum is σ = 4020330207702. Its totient is φ = 4020330207700.
The previous prime is 4020330207667. The next prime is 4020330207713. The reversal of 4020330207701 is 1077020330204.
4020330207701 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3754642536100 + 265687671601 = 1937690^2 + 515449^2 .
It is a cyclic number.
It is not a de Polignac number, because 4020330207701 - 26 = 4020330207637 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4020330207301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2010165103850 + 2010165103851.
It is an arithmetic number, because the mean of its divisors is an integer number (2010165103851).
Almost surely, 24020330207701 is an apocalyptic number.
It is an amenable number.
4020330207701 is a deficient number, since it is larger than the sum of its proper divisors (1).
4020330207701 is an equidigital number, since it uses as much as digits as its factorization.
4020330207701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7056, while the sum is 29.
Adding to 4020330207701 its reverse (1077020330204), we get a palindrome (5097350537905).
The spelling of 4020330207701 in words is "four trillion, twenty billion, three hundred thirty million, two hundred seven thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •