Base | Representation |
---|---|
bin | 1001110001110111111… |
… | …01100110001101100011 |
3 | 1012010022100120221122112 |
4 | 10320323331212031203 |
5 | 21001123420432011 |
6 | 414210142225535 |
7 | 33163504134530 |
oct | 4707375461543 |
9 | 1163270527575 |
10 | 336013452131 |
11 | 11a558919985 |
12 | 551562852ab |
13 | 258bbcbc6b6 |
14 | 1239809bd87 |
15 | 8b191cb58b |
hex | 4e3bf66363 |
336013452131 has 4 divisors (see below), whose sum is σ = 384015373872. Its totient is φ = 288011530392.
The previous prime is 336013452109. The next prime is 336013452139. The reversal of 336013452131 is 131254310633.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-336013452131 is a prime.
It is a super-2 number, since 2×3360134521312 (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 (336013452139) 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 3 ways as a sum of consecutive naturals, for example, 24000960860 + ... + 24000960873.
It is an arithmetic number, because the mean of its divisors is an integer number (96003843468).
Almost surely, 2336013452131 is an apocalyptic number.
336013452131 is a deficient number, since it is larger than the sum of its proper divisors (48001921741).
336013452131 is an equidigital number, since it uses as much as digits as its factorization.
336013452131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48001921740.
The product of its (nonzero) digits is 19440, while the sum is 32.
Adding to 336013452131 its reverse (131254310633), we get a palindrome (467267762764).
The spelling of 336013452131 in words is "three hundred thirty-six billion, thirteen million, four hundred fifty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •