Base | Representation |
---|---|
bin | 1011101001001111101… |
… | …01001011100101001111 |
3 | 1102020201200010121200012 |
4 | 11310213311023211033 |
5 | 23023401123223043 |
6 | 503445320023435 |
7 | 40622566452302 |
oct | 5644765134517 |
9 | 1366650117605 |
10 | 400100211023 |
11 | 144755158427 |
12 | 65660901b7b |
13 | 2b963326bc6 |
14 | 1551760ab39 |
15 | a61a5e0a18 |
hex | 5d27d4b94f |
400100211023 has 4 divisors (see below), whose sum is σ = 400153700688. Its totient is φ = 400046721360.
The previous prime is 400100211011. The next prime is 400100211037. The reversal of 400100211023 is 320112001004.
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 400100211023 - 28 = 400100210767 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 400100210989 and 400100211007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (400100271023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26733611 + ... + 26748572.
It is an arithmetic number, because the mean of its divisors is an integer number (100038425172).
Almost surely, 2400100211023 is an apocalyptic number.
400100211023 is a deficient number, since it is larger than the sum of its proper divisors (53489665).
400100211023 is an equidigital number, since it uses as much as digits as its factorization.
400100211023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53489664.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 400100211023 its reverse (320112001004), we get a palindrome (720212212027).
The spelling of 400100211023 in words is "four hundred billion, one hundred million, two hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •