Base | Representation |
---|---|
bin | 1011101011010101011… |
… | …01010100000100010111 |
3 | 1102100121212101200112010 |
4 | 11311222231110010113 |
5 | 23033200342101403 |
6 | 504152520355303 |
7 | 40662442421523 |
oct | 5655255240427 |
9 | 1370555350463 |
10 | 401222222103 |
11 | 145180536a0a |
12 | 65914615b33 |
13 | 2bab19134a1 |
14 | 155c2638d83 |
15 | a683d73603 |
hex | 5d6ab54117 |
401222222103 has 8 divisors (see below), whose sum is σ = 534989525616. Its totient is φ = 267468200000.
The previous prime is 401222222101. The next prime is 401222222147. The reversal of 401222222103 is 301222222104.
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 401222222103 - 21 = 401222222101 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 401222222103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401222222101) 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, 3249648 + ... + 3370853.
It is an arithmetic number, because the mean of its divisors is an integer number (66873690702).
Almost surely, 2401222222103 is an apocalyptic number.
401222222103 is a deficient number, since it is larger than the sum of its proper divisors (133767303513).
401222222103 is a wasteful number, since it uses less digits than its factorization.
401222222103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6640705.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 401222222103 its reverse (301222222104), we get a palindrome (702444444207).
Subtracting from 401222222103 its reverse (301222222104), we obtain a palindrome (99999999999).
The spelling of 401222222103 in words is "four hundred one billion, two hundred twenty-two million, two hundred twenty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •