Base | Representation |
---|---|
bin | 11100001100001111… |
… | …010111100010110010 |
3 | 2220010120120201221100 |
4 | 130030033113202302 |
5 | 443443123020013 |
6 | 21523401505230 |
7 | 2121056553651 |
oct | 341417274262 |
9 | 86116521840 |
10 | 30270126258 |
11 | 11923773979 |
12 | 5a494a2216 |
13 | 2b15333518 |
14 | 1672283198 |
15 | bc26d6473 |
hex | 70c3d78b2 |
30270126258 has 96 divisors (see below), whose sum is σ = 69715002240. Its totient is φ = 9471813120.
The previous prime is 30270126251. The next prime is 30270126259. The reversal of 30270126258 is 85262107203.
30270126258 is a `hidden beast` number, since 3 + 0 + 27 + 0 + 1 + 2 + 625 + 8 = 666.
It is a super-2 number, since 2×302701262582 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (30270126251) 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, 14216938 + ... + 14219066.
It is an arithmetic number, because the mean of its divisors is an integer number (726197940).
Almost surely, 230270126258 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30270126258, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34857501120).
30270126258 is an abundant number, since it is smaller than the sum of its proper divisors (39444875982).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30270126258 is a wasteful number, since it uses less digits than its factorization.
30270126258 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2784 (or 2781 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 36.
The spelling of 30270126258 in words is "thirty billion, two hundred seventy million, one hundred twenty-six thousand, two hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •