Base | Representation |
---|---|
bin | 11101111110110011100… |
… | …00010100000001010110 |
3 | 10122110222221220202021011 |
4 | 32333121300110001112 |
5 | 113334222012121114 |
6 | 2105124500242434 |
7 | 134266042545424 |
oct | 16773160240126 |
9 | 3573887822234 |
10 | 1030150504534 |
11 | 367980116238 |
12 | 1477973a041a |
13 | 761b18a8378 |
14 | 37c0686c114 |
15 | 1bbe36be1c4 |
hex | efd9c14056 |
1030150504534 has 8 divisors (see below), whose sum is σ = 1636121389608. Its totient is φ = 484776708000.
The previous prime is 1030150504507. The next prime is 1030150504561. The reversal of 1030150504534 is 4354050510301.
1030150504534 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (1030150504507) and next prime (1030150504561).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×10301505045342 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1030150504496 and 1030150504505.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15149272092 + ... + 15149272159.
It is an arithmetic number, because the mean of its divisors is an integer number (204515173701).
Almost surely, 21030150504534 is an apocalyptic number.
1030150504534 is a deficient number, since it is larger than the sum of its proper divisors (605970885074).
1030150504534 is a wasteful number, since it uses less digits than its factorization.
1030150504534 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30298544270.
The product of its (nonzero) digits is 18000, while the sum is 31.
The spelling of 1030150504534 in words is "one trillion, thirty billion, one hundred fifty million, five hundred four thousand, five hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •