Base | Representation |
---|---|
bin | 100000101001110010… |
… | …0000111000011100110 |
3 | 20200222212212211100120 |
4 | 1001103210013003212 |
5 | 2122102042424000 |
6 | 52114030022410 |
7 | 5031450335250 |
oct | 1012344070346 |
9 | 220885784316 |
10 | 70121451750 |
11 | 27813805619 |
12 | 1170b647a06 |
13 | 67c665c2ac |
14 | 3572bcccd0 |
15 | 1c561016a0 |
hex | 10539070e6 |
70121451750 has 128 divisors (see below), whose sum is σ = 200281835520. Its totient is φ = 16007299200.
The previous prime is 70121451749. The next prime is 70121451761. The reversal of 70121451750 is 5715412107.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4312636 + ... + 4328864.
It is an arithmetic number, because the mean of its divisors is an integer number (1564701840).
Almost surely, 270121451750 is an apocalyptic number.
70121451750 is a gapful number since it is divisible by the number (70) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 70121451750, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (100140917760).
70121451750 is an abundant number, since it is smaller than the sum of its proper divisors (130160383770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70121451750 is a wasteful number, since it uses less digits than its factorization.
70121451750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17079 (or 17069 counting only the distinct ones).
The product of its (nonzero) digits is 9800, while the sum is 33.
Adding to 70121451750 its reverse (5715412107), we get a palindrome (75836863857).
The spelling of 70121451750 in words is "seventy billion, one hundred twenty-one million, four hundred fifty-one thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •