Base | Representation |
---|---|
bin | 11100100000110001… |
… | …110110100110011001 |
3 | 2221000120222102220101 |
4 | 130200301312212121 |
5 | 1000144331220211 |
6 | 22021511255401 |
7 | 2132442514162 |
oct | 344061664631 |
9 | 87016872811 |
10 | 30614710681 |
11 | 11a9022a295 |
12 | 5b2497a561 |
13 | 2b6b841729 |
14 | 16a5d40769 |
15 | be2aa05c1 |
hex | 720c76999 |
30614710681 has 16 divisors (see below), whose sum is σ = 32127863040. Its totient is φ = 29138313600.
The previous prime is 30614710669. The next prime is 30614710733. The reversal of 30614710681 is 18601741603.
It is a cyclic number.
It is not a de Polignac number, because 30614710681 - 211 = 30614708633 is a prime.
It is a super-2 number, since 2×306147106812 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30614710681.
It is not an unprimeable number, because it can be changed into a prime (30614710081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4742506 + ... + 4748956.
It is an arithmetic number, because the mean of its divisors is an integer number (2007991440).
Almost surely, 230614710681 is an apocalyptic number.
It is an amenable number.
30614710681 is a deficient number, since it is larger than the sum of its proper divisors (1513152359).
30614710681 is a wasteful number, since it uses less digits than its factorization.
30614710681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9264.
The product of its (nonzero) digits is 24192, while the sum is 37.
The spelling of 30614710681 in words is "thirty billion, six hundred fourteen million, seven hundred ten thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •