Base | Representation |
---|---|
bin | 1001001110110100111111… |
… | …0001001010110111010000 |
3 | 1022221100211001202220021111 |
4 | 2103231033301022313100 |
5 | 2312300402034310224 |
6 | 33331000553503104 |
7 | 2065224015344251 |
oct | 223551761126720 |
9 | 38840731686244 |
10 | 10150346010064 |
11 | 32638127816a7 |
12 | 117b256411a94 |
13 | 5882342c4a60 |
14 | 2713ca82cb28 |
15 | 1290790bdd94 |
hex | 93b4fc4add0 |
10150346010064 has 40 divisors (see below), whose sum is σ = 21195417199880. Its totient is φ = 4681162948608.
The previous prime is 10150346010017. The next prime is 10150346010083. The reversal of 10150346010064 is 46001064305101.
It can be written as a sum of positive squares in 4 ways, for example, as 575158425664 + 9575187584400 = 758392^2 + 3094380^2 .
It is a super-3 number, since 3×101503460100643 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 18542769 + ... + 19082320.
It is an arithmetic number, because the mean of its divisors is an integer number (529885429997).
Almost surely, 210150346010064 is an apocalyptic number.
It is an amenable number.
10150346010064 is an abundant number, since it is smaller than the sum of its proper divisors (11045071189816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10150346010064 is a wasteful number, since it uses less digits than its factorization.
10150346010064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37626407 (or 37626401 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 31.
The spelling of 10150346010064 in words is "ten trillion, one hundred fifty billion, three hundred forty-six million, ten thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •