Base | Representation |
---|---|
bin | 1011011001101110… |
… | …0100101100001001 |
3 | 21220022012201200101 |
4 | 2312123210230021 |
5 | 22232013301411 |
6 | 1223413005401 |
7 | 135563235424 |
oct | 26633445411 |
9 | 7808181611 |
10 | 3060681481 |
11 | 1330747330 |
12 | 715023861 |
13 | 39a13c740 |
14 | 2106c09bb |
15 | 12da7d8c1 |
hex | b66e4b09 |
3060681481 has 32 divisors (see below), whose sum is σ = 3808788480. Its totient is φ = 2417947200.
The previous prime is 3060681469. The next prime is 3060681497. The reversal of 3060681481 is 1841860603.
3060681481 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 3060681481 - 213 = 3060673289 is a prime.
It is a super-2 number, since 2×30606814812 = 18735542256272706722, which contains 22 as substring.
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 3060681481.
It is not an unprimeable number, because it can be changed into a prime (3060681781) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 439416 + ... + 446326.
It is an arithmetic number, because the mean of its divisors is an integer number (119024640).
Almost surely, 23060681481 is an apocalyptic number.
It is an amenable number.
3060681481 is a deficient number, since it is larger than the sum of its proper divisors (748106999).
3060681481 is a wasteful number, since it uses less digits than its factorization.
3060681481 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7117.
The product of its (nonzero) digits is 27648, while the sum is 37.
The square root of 3060681481 is about 55323.4261502304. The cubic root of 3060681481 is about 1451.9089373700.
The spelling of 3060681481 in words is "three billion, sixty million, six hundred eighty-one thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •