Base | Representation |
---|---|
bin | 11000011000110100111000… |
… | …00101010011000001001000 |
3 | 21000212221022122211010112210 |
4 | 30030122130011103001020 |
5 | 24012131340023322133 |
6 | 310021031123305120 |
7 | 14203415665026126 |
oct | 1414323405230110 |
9 | 230787278733483 |
10 | 53629580292168 |
11 | 160a71a4a55711 |
12 | 6021931b1b1a0 |
13 | 23c032b32372a |
14 | d35985178916 |
15 | 630066092763 |
hex | 30c69c153048 |
53629580292168 has 16 divisors (see below), whose sum is σ = 134073950730480. Its totient is φ = 17876526764048.
The previous prime is 53629580292157. The next prime is 53629580292199. The reversal of 53629580292168 is 86129208592635.
It is a super-2 number, since 2×536295802921682 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 53629580292099 and 53629580292108.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1117282922730 + ... + 1117282922777.
It is an arithmetic number, because the mean of its divisors is an integer number (8379621920655).
Almost surely, 253629580292168 is an apocalyptic number.
It is an amenable number.
53629580292168 is an abundant number, since it is smaller than the sum of its proper divisors (80444370438312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53629580292168 is a wasteful number, since it uses less digits than its factorization.
53629580292168 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2234565845516 (or 2234565845512 counting only the distinct ones).
The product of its (nonzero) digits is 111974400, while the sum is 66.
The spelling of 53629580292168 in words is "fifty-three trillion, six hundred twenty-nine billion, five hundred eighty million, two hundred ninety-two thousand, one hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •