Base | Representation |
---|---|
bin | 100110000100010111001… |
… | …0000101101101101100001 |
3 | 200112011211022011112011122 |
4 | 1030020232100231231201 |
5 | 1141210212323100001 |
6 | 15043322514022025 |
7 | 1050000661524203 |
oct | 114105620555541 |
9 | 20464738145148 |
10 | 5232046300001 |
11 | 1737997812214 |
12 | 706009877915 |
13 | 2bc4c26b3b21 |
14 | 141337980773 |
15 | 9116e27ab1b |
hex | 4c22e42db61 |
5232046300001 has 4 divisors (see below), whose sum is σ = 5330764154772. Its totient is φ = 5133328445232.
The previous prime is 5232046299911. The next prime is 5232046300027. The reversal of 5232046300001 is 1000036402325.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4614526941025 + 617519358976 = 2148145^2 + 785824^2 .
It is a cyclic number.
It is not a de Polignac number, because 5232046300001 - 230 = 5230972558177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5232046306001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 49358927306 + ... + 49358927411.
It is an arithmetic number, because the mean of its divisors is an integer number (1332691038693).
Almost surely, 25232046300001 is an apocalyptic number.
It is an amenable number.
5232046300001 is a deficient number, since it is larger than the sum of its proper divisors (98717854771).
5232046300001 is an equidigital number, since it uses as much as digits as its factorization.
5232046300001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98717854770.
The product of its (nonzero) digits is 4320, while the sum is 26.
The spelling of 5232046300001 in words is "five trillion, two hundred thirty-two billion, forty-six million, three hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •