Base | Representation |
---|---|
bin | 1010101110010100110… |
… | …11011111011001011001 |
3 | 1022020002012100100201002 |
4 | 11113022123133121121 |
5 | 22014110404034111 |
6 | 441134433034345 |
7 | 35422663633556 |
oct | 5271233373131 |
9 | 1266065310632 |
10 | 368468424281 |
11 | 1322a2901911 |
12 | 5b4b33b59b5 |
13 | 28991b79a29 |
14 | 13b96595a2d |
15 | 98b85d963b |
hex | 55ca6df659 |
368468424281 has 16 divisors (see below), whose sum is σ = 390704893200. Its totient is φ = 346294745088.
The previous prime is 368468424271. The next prime is 368468424283. The reversal of 368468424281 is 182424864863.
It can be written as a sum of positive squares in 8 ways, for example, as 25 + 368468424256 = 5^2 + 607016^2 .
It is a cyclic number.
It is not a de Polignac number, because 368468424281 - 214 = 368468407897 is a prime.
It is a super-2 number, since 2×3684684242812 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (368468424283) 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 15 ways as a sum of consecutive naturals, for example, 48936125 + ... + 48943653.
It is an arithmetic number, because the mean of its divisors is an integer number (24419055825).
Almost surely, 2368468424281 is an apocalyptic number.
It is an amenable number.
368468424281 is a deficient number, since it is larger than the sum of its proper divisors (22236468919).
368468424281 is a wasteful number, since it uses less digits than its factorization.
368468424281 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11308.
The product of its digits is 14155776, while the sum is 56.
The spelling of 368468424281 in words is "three hundred sixty-eight billion, four hundred sixty-eight million, four hundred twenty-four thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •