Base | Representation |
---|---|
bin | 101101011111000011001000… |
… | …0010101011111010011110101 |
3 | 1221110121101010020121200000101 |
4 | 1122332012100111133103311 |
5 | 404420044403034423121 |
6 | 3534531300301314101 |
7 | 150162441410512624 |
oct | 13276062025372365 |
9 | 1843541106550011 |
10 | 400091510076661 |
11 | 10653294708a727 |
12 | 38a584b9265931 |
13 | 1423261017ca00 |
14 | 70b2764d0d6bb |
15 | 313c471d45491 |
hex | 16be19055f4f5 |
400091510076661 has 6 divisors (see below), whose sum is σ = 433235185467810. Its totient is φ = 369315240070608.
The previous prime is 400091510076589. The next prime is 400091510076677. The reversal of 400091510076661 is 166670015190004.
It can be written as a sum of positive squares in 3 ways, for example, as 5829781276036 + 394261728800625 = 2414494^2 + 19856025^2 .
It is not a de Polignac number, because 400091510076661 - 213 = 400091510068469 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (400091510070661) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1183702692366 + ... + 1183702692703.
It is an arithmetic number, because the mean of its divisors is an integer number (72205864244635).
Almost surely, 2400091510076661 is an apocalyptic number.
It is an amenable number.
400091510076661 is a deficient number, since it is larger than the sum of its proper divisors (33143675391149).
400091510076661 is a wasteful number, since it uses less digits than its factorization.
400091510076661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2367405385095 (or 2367405385082 counting only the distinct ones).
The product of its (nonzero) digits is 272160, while the sum is 46.
The spelling of 400091510076661 in words is "four hundred trillion, ninety-one billion, five hundred ten million, seventy-six thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •