Base | Representation |
---|---|
bin | 10111111010111… |
… | …101101111010010 |
3 | 1000222011211122200 |
4 | 113322331233102 |
5 | 1310220130302 |
6 | 103453544030 |
7 | 12642163434 |
oct | 2772755722 |
9 | 1028154580 |
10 | 401333202 |
11 | 1965a6636 |
12 | b24a5016 |
13 | 651ba38a |
14 | 3b430654 |
15 | 2537881c |
hex | 17ebdbd2 |
401333202 has 12 divisors (see below), whose sum is σ = 869555310. Its totient is φ = 133777728.
The previous prime is 401333201. The next prime is 401333209. The reversal of 401333202 is 202333104.
It can be written as a sum of positive squares in only one way, i.e., 267028281 + 134304921 = 16341^2 + 11589^2 .
It is a super-2 number, since 2×4013332022 = 322136678055145608, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 22296289 = 401333202 / (4 + 0 + 1 + 3 + 3 + 3 + 2 + 0 + 2).
It is not an unprimeable number, because it can be changed into a prime (401333201) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 11148127 + ... + 11148162.
Almost surely, 2401333202 is an apocalyptic number.
401333202 is an abundant number, since it is smaller than the sum of its proper divisors (468222108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
401333202 is a wasteful number, since it uses less digits than its factorization.
401333202 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22296297 (or 22296294 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
The square root of 401333202 is about 20033.3023238806. The cubic root of 401333202 is about 737.6239849772.
Adding to 401333202 its reverse (202333104), we get a palindrome (603666306).
The spelling of 401333202 in words is "four hundred one million, three hundred thirty-three thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •