Base | Representation |
---|---|
bin | 11100110010100111… |
… | …111001110111100001 |
3 | 2221210110022121120101 |
4 | 130302213321313201 |
5 | 1001303001430023 |
6 | 22111324142401 |
7 | 2143036310413 |
oct | 346247716741 |
9 | 87713277511 |
10 | 30914092513 |
11 | 12124221297 |
12 | 5ba9097a01 |
13 | 2bb8884045 |
14 | 16d39d29b3 |
15 | c0dedb1ad |
hex | 7329f9de1 |
30914092513 has 4 divisors (see below), whose sum is σ = 31029015060. Its totient is φ = 30799169968.
The previous prime is 30914092511. The next prime is 30914092529. The reversal of 30914092513 is 31529041903.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 31529041903 = 14957 ⋅2107979.
It can be written as a sum of positive squares in 2 ways, for example, as 4879301904 + 26034790609 = 69852^2 + 161353^2 .
It is a cyclic number.
It is not a de Polignac number, because 30914092513 - 21 = 30914092511 is a prime.
It is a super-2 number, since 2×309140925132 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30914092511) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 57460870 + ... + 57461407.
It is an arithmetic number, because the mean of its divisors is an integer number (7757253765).
Almost surely, 230914092513 is an apocalyptic number.
It is an amenable number.
30914092513 is a deficient number, since it is larger than the sum of its proper divisors (114922547).
30914092513 is a wasteful number, since it uses less digits than its factorization.
30914092513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114922546.
The product of its (nonzero) digits is 29160, while the sum is 37.
The spelling of 30914092513 in words is "thirty billion, nine hundred fourteen million, ninety-two thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •