Base | Representation |
---|---|
bin | 101101100001110001000110… |
… | …1010111000100111100010101 |
3 | 1221111221002110220221220112020 |
4 | 1123003202031113010330111 |
5 | 404442210032303103203 |
6 | 3535415045404243353 |
7 | 150231436024244154 |
oct | 13303421527047425 |
9 | 1844832426856466 |
10 | 400465122316053 |
11 | 106667339496a03 |
12 | 38ab89a7240559 |
13 | 1425b911900002 |
14 | 70c68886c159b |
15 | 314703bce3153 |
hex | 16c388d5c4f15 |
400465122316053 has 16 divisors (see below), whose sum is σ = 536261742319680. Its totient is φ = 265822696202624.
The previous prime is 400465122316043. The next prime is 400465122316087. The reversal of 400465122316053 is 350613221564004.
It is a cyclic number.
It is not a de Polignac number, because 400465122316053 - 224 = 400465105538837 is a prime.
It is a super-2 number, since 2×4004651223160532 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 400465122315996 and 400465122316014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (400465122316003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13770403 + ... + 31473071.
It is an arithmetic number, because the mean of its divisors is an integer number (33516358894980).
Almost surely, 2400465122316053 is an apocalyptic number.
It is an amenable number.
400465122316053 is a deficient number, since it is larger than the sum of its proper divisors (135796620003627).
400465122316053 is a wasteful number, since it uses less digits than its factorization.
400465122316053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17735268.
The product of its (nonzero) digits is 518400, while the sum is 42.
The spelling of 400465122316053 in words is "four hundred trillion, four hundred sixty-five billion, one hundred twenty-two million, three hundred sixteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •