Base | Representation |
---|---|
bin | 10010000100110001010… |
… | …00110001010010111011 |
3 | 2012101000002000102111110 |
4 | 21002120220301102323 |
5 | 40133340221141011 |
6 | 1153144451131403 |
7 | 62603565610515 |
oct | 11023050612273 |
9 | 2171002012443 |
10 | 621036115131 |
11 | 21a41a773213 |
12 | a043b8a3b63 |
13 | 46742ba8803 |
14 | 220b5dd8bb5 |
15 | 1124ba50ba6 |
hex | 9098a314bb |
621036115131 has 4 divisors (see below), whose sum is σ = 828048153512. Its totient is φ = 414024076752.
The previous prime is 621036115121. The next prime is 621036115151. The reversal of 621036115131 is 131511630126.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 621036115131 - 27 = 621036115003 is a prime.
It is a super-2 number, since 2×6210361151312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (621036115121) by changing a digit.
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, 103506019186 + ... + 103506019191.
It is an arithmetic number, because the mean of its divisors is an integer number (207012038378).
Almost surely, 2621036115131 is an apocalyptic number.
621036115131 is a deficient number, since it is larger than the sum of its proper divisors (207012038381).
621036115131 is a wasteful number, since it uses less digits than its factorization.
621036115131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 207012038380.
The product of its (nonzero) digits is 3240, while the sum is 30.
Adding to 621036115131 its reverse (131511630126), we get a palindrome (752547745257).
The spelling of 621036115131 in words is "six hundred twenty-one billion, thirty-six million, one hundred fifteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •