Base | Representation |
---|---|
bin | 111010100010001011001… |
… | …010010010111101110001 |
3 | 112020112120122122002022121 |
4 | 322202023022102331301 |
5 | 1011400411033334301 |
6 | 12315513124434241 |
7 | 563416263615553 |
oct | 72421312227561 |
9 | 15215518562277 |
10 | 4022424121201 |
11 | 131099a608842 |
12 | 54b6a5848981 |
13 | 23240b7861c5 |
14 | dc9875634d3 |
15 | 6e9749643a1 |
hex | 3a88b292f71 |
4022424121201 has 8 divisors (see below), whose sum is σ = 4059371782400. Its totient is φ = 3985477272720.
The previous prime is 4022424121127. The next prime is 4022424121211. The reversal of 4022424121201 is 1021214242204.
4022424121201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 4022424121201 - 215 = 4022424088433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4022424121211) 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, 14811406 + ... + 15080536.
It is an arithmetic number, because the mean of its divisors is an integer number (507421472800).
Almost surely, 24022424121201 is an apocalyptic number.
It is an amenable number.
4022424121201 is a deficient number, since it is larger than the sum of its proper divisors (36947661199).
4022424121201 is a wasteful number, since it uses less digits than its factorization.
4022424121201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 406359.
The product of its (nonzero) digits is 2048, while the sum is 25.
Adding to 4022424121201 its reverse (1021214242204), we get a palindrome (5043638363405).
The spelling of 4022424121201 in words is "four trillion, twenty-two billion, four hundred twenty-four million, one hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •