Base | Representation |
---|---|
bin | 111010100001000010111… |
… | …111011011110011111101 |
3 | 112020102110021021201111121 |
4 | 322201002333123303331 |
5 | 1011340421102024201 |
6 | 12315153032550541 |
7 | 563344262130361 |
oct | 72410277336375 |
9 | 15212407251447 |
10 | 4021213314301 |
11 | 13104290a0687 |
12 | 54b408252451 |
13 | 232277979b11 |
14 | dc8b081d2a1 |
15 | 6e9034e19a1 |
hex | 3a842fdbcfd |
4021213314301 has 8 divisors (see below), whose sum is σ = 4053209068544. Its totient is φ = 3989222758080.
The previous prime is 4021213314289. The next prime is 4021213314383. The reversal of 4021213314301 is 1034133121204.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4021213314301 - 213 = 4021213306109 is a prime.
It is a super-2 number, since 2×40212133143012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4021213317301) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 261286 + ... + 2847928.
It is an arithmetic number, because the mean of its divisors is an integer number (506651133568).
Almost surely, 24021213314301 is an apocalyptic number.
It is an amenable number.
4021213314301 is a deficient number, since it is larger than the sum of its proper divisors (31995754243).
4021213314301 is a wasteful number, since it uses less digits than its factorization.
4021213314301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2599011.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 4021213314301 its reverse (1034133121204), we get a palindrome (5055346435505).
The spelling of 4021213314301 in words is "four trillion, twenty-one billion, two hundred thirteen million, three hundred fourteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •