Base | Representation |
---|---|
bin | 100010110101101110100… |
… | …1111000001001000101011 |
3 | 121221202110020010120022101 |
4 | 1011223131033001020223 |
5 | 1111422422122104131 |
6 | 14103414515434231 |
7 | 1002641445145255 |
oct | 105533517011053 |
9 | 17852406116271 |
10 | 4788305269291 |
11 | 1586788548065 |
12 | 6540098b5977 |
13 | 2896c5c348bb |
14 | 127a8042ccd5 |
15 | 8484c72bc61 |
hex | 45add3c122b |
4788305269291 has 8 divisors (see below), whose sum is σ = 4854345960464. Its totient is φ = 4722276672000.
The previous prime is 4788305269271. The next prime is 4788305269303. The reversal of 4788305269291 is 1929625038874.
4788305269291 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4788305269291 - 25 = 4788305269259 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4788305269211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2224710 + ... + 3811291.
It is an arithmetic number, because the mean of its divisors is an integer number (606793245058).
It is a 1-persistent number, because it is pandigital, but 2⋅4788305269291 = 9576610538582 is not.
Almost surely, 24788305269291 is an apocalyptic number.
4788305269291 is a deficient number, since it is larger than the sum of its proper divisors (66040691173).
4788305269291 is a wasteful number, since it uses less digits than its factorization.
4788305269291 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6046941.
The product of its (nonzero) digits is 52254720, while the sum is 64.
The spelling of 4788305269291 in words is "four trillion, seven hundred eighty-eight billion, three hundred five million, two hundred sixty-nine thousand, two hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •