Base | Representation |
---|---|
bin | 111010011000101010011… |
… | …010011111010010001110 |
3 | 112012120012212220212200120 |
4 | 322120222122133102032 |
5 | 1011214002011311142 |
6 | 12311103451005410 |
7 | 562605221102013 |
oct | 72305232372216 |
9 | 15176185825616 |
10 | 4012211041422 |
11 | 1307629597841 |
12 | 549715439866 |
13 | 2314718b212c |
14 | dc298db570a |
15 | 6e5780167ec |
hex | 3a62a69f48e |
4012211041422 has 8 divisors (see below), whose sum is σ = 8024422082856. Its totient is φ = 1337403680472.
The previous prime is 4012211041409. The next prime is 4012211041427. The reversal of 4012211041422 is 2241401122104.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
4012211041422 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 4012211041392 and 4012211041401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4012211041427) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 334350920113 + ... + 334350920124.
It is an arithmetic number, because the mean of its divisors is an integer number (1003052760357).
Almost surely, 24012211041422 is an apocalyptic number.
4012211041422 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4012211041422 is a wasteful number, since it uses less digits than its factorization.
4012211041422 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 668701840242.
The product of its (nonzero) digits is 1024, while the sum is 24.
Adding to 4012211041422 its reverse (2241401122104), we get a palindrome (6253612163526).
The spelling of 4012211041422 in words is "four trillion, twelve billion, two hundred eleven million, forty-one thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •