Base | Representation |
---|---|
bin | 1000110010100100110… |
… | …01000011011100000000 |
3 | 1001212120222202020002211 |
4 | 10121102121003130000 |
5 | 14422024140310422 |
6 | 350430051151504 |
7 | 30551404504225 |
oct | 4312231033400 |
9 | 1055528666084 |
10 | 302030010112 |
11 | 1070aa080a06 |
12 | 4a6512a5594 |
13 | 2263458271c |
14 | 108929ad94c |
15 | 7cca9ed577 |
hex | 4652643700 |
302030010112 has 72 divisors (see below), whose sum is σ = 627230277632. Its totient is φ = 144992332800.
The previous prime is 302030010103. The next prime is 302030010151. The reversal of 302030010112 is 211010030203.
It is a junction number, because it is equal to n+sod(n) for n = 302030010092 and 302030010101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 858037 + ... + 1157707.
Almost surely, 2302030010112 is an apocalyptic number.
302030010112 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 302030010112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (313615138816).
302030010112 is an abundant number, since it is smaller than the sum of its proper divisors (325200267520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
302030010112 is a wasteful number, since it uses less digits than its factorization.
302030010112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 299845 (or 299831 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 302030010112 its reverse (211010030203), we get a palindrome (513040040315).
The spelling of 302030010112 in words is "three hundred two billion, thirty million, ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •