Base | Representation |
---|---|
bin | 101101010101100001… |
… | …010010101101100101 |
3 | 11122122112221022112101 |
4 | 231111201102231211 |
5 | 1244143413243023 |
6 | 34210225052101 |
7 | 3342215223253 |
oct | 552541225545 |
9 | 148575838471 |
10 | 48679431013 |
11 | 197102a7024 |
12 | 9526787031 |
13 | 478a2b2665 |
14 | 24db1b75d3 |
15 | 13ed9901ad |
hex | b55852b65 |
48679431013 has 6 divisors (see below), whose sum is σ = 49837840134. Its totient is φ = 47547349416.
The previous prime is 48679431007. The next prime is 48679431041. The reversal of 48679431013 is 31013497684.
48679431013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 29969841924 + 18709589089 = 173118^2 + 136783^2 .
It is not a de Polignac number, because 48679431013 - 25 = 48679430981 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48679431083) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 13161870 + ... + 13165567.
It is an arithmetic number, because the mean of its divisors is an integer number (8306306689).
Almost surely, 248679431013 is an apocalyptic number.
48679431013 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
It is an amenable number.
48679431013 is a deficient number, since it is larger than the sum of its proper divisors (1158409121).
48679431013 is an equidigital number, since it uses as much as digits as its factorization.
48679431013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26327523 (or 26327480 counting only the distinct ones).
The product of its (nonzero) digits is 435456, while the sum is 46.
The spelling of 48679431013 in words is "forty-eight billion, six hundred seventy-nine million, four hundred thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •