Base | Representation |
---|---|
bin | 101001110000100… |
… | …1111010100100001 |
3 | 10121122122110211011 |
4 | 1103201033110201 |
5 | 10332203104213 |
6 | 351013020521 |
7 | 46503123412 |
oct | 12341172441 |
9 | 3548573734 |
10 | 1401222433 |
11 | 659a54176 |
12 | 331324741 |
13 | 1943b9000 |
14 | d414d809 |
15 | 8303703d |
hex | 5384f521 |
1401222433 has 16 divisors (see below), whose sum is σ = 1607271120. Its totient is φ = 1217319168.
The previous prime is 1401222401. The next prime is 1401222457. The reversal of 1401222433 is 3342221041.
It can be written as a sum of positive squares in 8 ways, for example, as 763306384 + 637916049 = 27628^2 + 25257^2 .
It is not a de Polignac number, because 1401222433 - 25 = 1401222401 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1401222463) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18591 + ... + 56107.
It is an arithmetic number, because the mean of its divisors is an integer number (100454445).
Almost surely, 21401222433 is an apocalyptic number.
1401222433 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1401222433 is a deficient number, since it is larger than the sum of its proper divisors (206048687).
1401222433 is an equidigital number, since it uses as much as digits as its factorization.
1401222433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37573 (or 37547 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 22.
The square root of 1401222433 is about 37432.9057514909. The cubic root of 1401222433 is about 1119.0144479023.
Adding to 1401222433 its reverse (3342221041), we get a palindrome (4743443474).
The spelling of 1401222433 in words is "one billion, four hundred one million, two hundred twenty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •