Base | Representation |
---|---|
bin | 11101010100000011110… |
… | …11010011101000101010 |
3 | 10120021202122112210212101 |
4 | 32222001323103220222 |
5 | 113000222222430200 |
6 | 2050411405404014 |
7 | 132524260026430 |
oct | 16520173235052 |
9 | 3507678483771 |
10 | 1007202155050 |
11 | 3591743a4653 |
12 | 143251b6960a |
13 | 73c95431950 |
14 | 36a6ab86d50 |
15 | 1b2edbb326a |
hex | ea81ed3a2a |
1007202155050 has 96 divisors (see below), whose sum is σ = 2306964844800. Its totient is φ = 318590530560.
The previous prime is 1007202155027. The next prime is 1007202155059. The reversal of 1007202155050 is 505512027001.
1007202155050 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×10072021550502 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1007202155059) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 8490546 + ... + 8608354.
It is an arithmetic number, because the mean of its divisors is an integer number (24030883800).
Almost surely, 21007202155050 is an apocalyptic number.
1007202155050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1007202155050 is an abundant number, since it is smaller than the sum of its proper divisors (1299762689750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1007202155050 is a wasteful number, since it uses less digits than its factorization.
1007202155050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 119720 (or 119715 counting only the distinct ones).
The product of its (nonzero) digits is 3500, while the sum is 28.
The spelling of 1007202155050 in words is "one trillion, seven billion, two hundred two million, one hundred fifty-five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •