Base | Representation |
---|---|
bin | 100110100100101000111… |
… | …1011001100001100111001 |
3 | 200202210202011212100002200 |
4 | 1031021101323030030321 |
5 | 1143324143203123413 |
6 | 15135225115220413 |
7 | 1055003513316105 |
oct | 115112173141471 |
9 | 20683664770080 |
10 | 5301364114233 |
11 | 1764328921aa0 |
12 | 717534147709 |
13 | 2c5bbb6b8655 |
14 | 144831b38905 |
15 | 92d79a37573 |
hex | 4d251ecc339 |
5301364114233 has 36 divisors (see below), whose sum is σ = 8816471630928. Its totient is φ = 3043845403920.
The previous prime is 5301364114217. The next prime is 5301364114237. The reversal of 5301364114233 is 3324114631035.
5301364114233 is a `hidden beast` number, since 5 + 3 + 0 + 1 + 3 + 6 + 411 + 4 + 233 = 666.
It is not a de Polignac number, because 5301364114233 - 24 = 5301364114217 is a prime.
It is a super-2 number, since 2×53013641142332 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5301364114237) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 74132035 + ... + 74203512.
It is an arithmetic number, because the mean of its divisors is an integer number (244901989748).
Almost surely, 25301364114233 is an apocalyptic number.
It is an amenable number.
5301364114233 is a deficient number, since it is larger than the sum of its proper divisors (3515107516695).
5301364114233 is a wasteful number, since it uses less digits than its factorization.
5301364114233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148335602 (or 148335580 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 36.
Adding to 5301364114233 its reverse (3324114631035), we get a palindrome (8625478745268).
The spelling of 5301364114233 in words is "five trillion, three hundred one billion, three hundred sixty-four million, one hundred fourteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •