Base | Representation |
---|---|
bin | 1011101101100110101… |
… | …10101000000000011111 |
3 | 1102110202210202120220012 |
4 | 11312303112220000133 |
5 | 23043144344324411 |
6 | 504513455313435 |
7 | 41034602103560 |
oct | 5666326500037 |
9 | 1373683676805 |
10 | 402441011231 |
11 | 145746506256 |
12 | 65bb481b87b |
13 | 2bc47285b9c |
14 | 1569a45a167 |
15 | a705d7118b |
hex | 5db35a801f |
402441011231 has 8 divisors (see below), whose sum is σ = 468610557984. Its totient is φ = 338440957920.
The previous prime is 402441011227. The next prime is 402441011263. The reversal of 402441011231 is 132110144204.
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 402441011231 - 22 = 402441011227 is a prime.
It is a super-2 number, since 2×4024410112312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 402441011197 and 402441011206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (402441011201) 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, 542372960 + ... + 542373701.
It is an arithmetic number, because the mean of its divisors is an integer number (58576319748).
Almost surely, 2402441011231 is an apocalyptic number.
402441011231 is a deficient number, since it is larger than the sum of its proper divisors (66169546753).
402441011231 is a wasteful number, since it uses less digits than its factorization.
402441011231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1084746721.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 402441011231 its reverse (132110144204), we get a palindrome (534551155435).
The spelling of 402441011231 in words is "four hundred two billion, four hundred forty-one million, eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •