Base | Representation |
---|---|
bin | 1011101001010011001… |
… | …11001111111011001111 |
3 | 1102020210202101210210101 |
4 | 11310221213033323033 |
5 | 23023431302110411 |
6 | 503452304551531 |
7 | 40623411562612 |
oct | 5645147177317 |
9 | 1366722353711 |
10 | 400130113231 |
11 | 1447700213a2 |
12 | 6566a9225a7 |
13 | 2b969596514 |
14 | 1551b592179 |
15 | a61d04a8c1 |
hex | 5d299cfecf |
400130113231 has 4 divisors (see below), whose sum is σ = 400181492200. Its totient is φ = 400078734264.
The previous prime is 400130113223. The next prime is 400130113237. The reversal of 400130113231 is 132311031004.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 400130113231 - 23 = 400130113223 is a prime.
It is a super-2 number, since 2×4001301132312 (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 = 400130113199 and 400130113208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (400130113237) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25677801 + ... + 25693378.
It is an arithmetic number, because the mean of its divisors is an integer number (100045373050).
Almost surely, 2400130113231 is an apocalyptic number.
400130113231 is a deficient number, since it is larger than the sum of its proper divisors (51378969).
400130113231 is an equidigital number, since it uses as much as digits as its factorization.
400130113231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51378968.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 400130113231 its reverse (132311031004), we get a palindrome (532441144235).
The spelling of 400130113231 in words is "four hundred billion, one hundred thirty million, one hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •