Base | Representation |
---|---|
bin | 1011101001010110001… |
… | …10010011101111100111 |
3 | 1102020212111021211200011 |
4 | 11310223012103233213 |
5 | 23024004142020201 |
6 | 503454555031051 |
7 | 40624133440651 |
oct | 5645306235747 |
9 | 1366774254604 |
10 | 400155032551 |
11 | 1447830a167a |
12 | 6567713b487 |
13 | 2b9717aca91 |
14 | 155209db6d1 |
15 | a62031e151 |
hex | 5d2b193be7 |
400155032551 has 4 divisors (see below), whose sum is σ = 400235180752. Its totient is φ = 400074884352.
The previous prime is 400155032549. The next prime is 400155032611. The reversal of 400155032551 is 155230551004.
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 400155032551 - 21 = 400155032549 is a prime.
It is a super-3 number, since 3×4001550325513 (a number of 36 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (400155030551) 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, 40066611 + ... + 40076596.
It is an arithmetic number, because the mean of its divisors is an integer number (100058795188).
Almost surely, 2400155032551 is an apocalyptic number.
400155032551 is a deficient number, since it is larger than the sum of its proper divisors (80148201).
400155032551 is an equidigital number, since it uses as much as digits as its factorization.
400155032551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80148200.
The product of its (nonzero) digits is 15000, while the sum is 31.
Adding to 400155032551 its reverse (155230551004), we get a palindrome (555385583555).
The spelling of 400155032551 in words is "four hundred billion, one hundred fifty-five million, thirty-two thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •