Base | Representation |
---|---|
bin | 101100010001000010… |
… | …010110011111100111 |
3 | 11112200110222000102202 |
4 | 230101002112133213 |
5 | 1234320300004401 |
6 | 33500222525115 |
7 | 3301564215641 |
oct | 542102263747 |
9 | 145613860382 |
10 | 47530469351 |
11 | 19180790132 |
12 | 9265a3679b |
13 | 463624b0a1 |
14 | 242c771891 |
15 | 1382b8706b |
hex | b110967e7 |
47530469351 has 8 divisors (see below), whose sum is σ = 47880313680. Its totient is φ = 47181221568.
The previous prime is 47530469339. The next prime is 47530469417. The reversal of 47530469351 is 15396403574.
47530469351 is digitally balanced in base 2, 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 47530469351 - 214 = 47530452967 is a prime.
It is a super-2 number, since 2×475304693512 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 47530469296 and 47530469305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (47530469951) 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, 11435 + ... + 308531.
It is an arithmetic number, because the mean of its divisors is an integer number (5985039210).
Almost surely, 247530469351 is an apocalyptic number.
47530469351 is a deficient number, since it is larger than the sum of its proper divisors (349844329).
47530469351 is a wasteful number, since it uses less digits than its factorization.
47530469351 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 298273.
The product of its (nonzero) digits is 1360800, while the sum is 47.
The spelling of 47530469351 in words is "forty-seven billion, five hundred thirty million, four hundred sixty-nine thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •