Base | Representation |
---|---|
bin | 111010011001100111001… |
… | …010101110111011110001 |
3 | 112012122211220212122221121 |
4 | 322121213022232323301 |
5 | 1011223043430241033 |
6 | 12311352541422241 |
7 | 562642405612516 |
oct | 72314712567361 |
9 | 15178756778847 |
10 | 4013230321393 |
11 | 1308001989987 |
12 | 54995a86a981 |
13 | 2315a4b0ca87 |
14 | dc35450130d |
15 | 6e5d775562d |
hex | 3a6672aeef1 |
4013230321393 has 2 divisors, whose sum is σ = 4013230321394. Its totient is φ = 4013230321392.
The previous prime is 4013230321391. The next prime is 4013230321409. The reversal of 4013230321393 is 3931230323104.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3103051356304 + 910178965089 = 1761548^2 + 954033^2 .
It is a cyclic number.
It is not a de Polignac number, because 4013230321393 - 21 = 4013230321391 is a prime.
It is a super-2 number, since 2×40132303213932 (a number of 26 digits) contains 22 as substring.
Together with 4013230321391, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (4013230321391) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2006615160696 + 2006615160697.
It is an arithmetic number, because the mean of its divisors is an integer number (2006615160697).
Almost surely, 24013230321393 is an apocalyptic number.
It is an amenable number.
4013230321393 is a deficient number, since it is larger than the sum of its proper divisors (1).
4013230321393 is an equidigital number, since it uses as much as digits as its factorization.
4013230321393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34992, while the sum is 34.
Adding to 4013230321393 its reverse (3931230323104), we get a palindrome (7944460644497).
The spelling of 4013230321393 in words is "four trillion, thirteen billion, two hundred thirty million, three hundred twenty-one thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •