Base | Representation |
---|---|
bin | 10101011111000001000111… |
… | …10100011110100110010010 |
3 | 20012021121020002111112112201 |
4 | 22233200203310132212102 |
5 | 22143031223222343003 |
6 | 244252055244113414 |
7 | 12644233056203113 |
oct | 1257404364364622 |
9 | 205247202445481 |
10 | 47245241215378 |
11 | 14065659a92308 |
12 | 537053b83586a |
13 | 20492900ab48b |
14 | b949790d220a |
15 | 56de55579b1d |
hex | 2af823d1e992 |
47245241215378 has 8 divisors (see below), whose sum is σ = 71032288417920. Its totient is φ = 23567811742740.
The previous prime is 47245241215363. The next prime is 47245241215379. The reversal of 47245241215378 is 87351214254274.
47245241215378 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 super-2 number, since 2×472452412153782 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (47245241215379) 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, 27404431398 + ... + 27404433121.
It is an arithmetic number, because the mean of its divisors is an integer number (8879036052240).
Almost surely, 247245241215378 is an apocalyptic number.
47245241215378 is a deficient number, since it is larger than the sum of its proper divisors (23787047202542).
47245241215378 is a wasteful number, since it uses less digits than its factorization.
47245241215378 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54808864952.
The product of its digits is 15052800, while the sum is 55.
The spelling of 47245241215378 in words is "forty-seven trillion, two hundred forty-five billion, two hundred forty-one million, two hundred fifteen thousand, three hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •