Base | Representation |
---|---|
bin | 1011101001011111100… |
… | …00111111010111010011 |
3 | 1102021001221121202202112 |
4 | 11310233300333113103 |
5 | 23024134213031011 |
6 | 503510433135535 |
7 | 40626104113535 |
oct | 5645760772723 |
9 | 1367057552675 |
10 | 400233330131 |
11 | 14481330a818 |
12 | 656993ba5ab |
13 | 2b984a952cb |
14 | 1552b17d855 |
15 | a62713858b |
hex | 5d2fc3f5d3 |
400233330131 has 8 divisors (see below), whose sum is σ = 406406319360. Its totient is φ = 394066204488.
The previous prime is 400233330121. The next prime is 400233330137. The reversal of 400233330131 is 131033332004.
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 400233330131 - 26 = 400233330067 is a prime.
It is a super-2 number, since 2×4002333301312 (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 = 400233330097 and 400233330106.
It is not an unprimeable number, because it can be changed into a prime (400233330137) 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, 1328231 + ... + 1601456.
It is an arithmetic number, because the mean of its divisors is an integer number (50800789920).
Almost surely, 2400233330131 is an apocalyptic number.
400233330131 is a deficient number, since it is larger than the sum of its proper divisors (6172989229).
400233330131 is a wasteful number, since it uses less digits than its factorization.
400233330131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2931793.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 400233330131 its reverse (131033332004), we get a palindrome (531266662135).
The spelling of 400233330131 in words is "four hundred billion, two hundred thirty-three million, three hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •