Base | Representation |
---|---|
bin | 100111110000110000101… |
… | …110010000101100111101 |
3 | 100200012211210221212020112 |
4 | 213300300232100230331 |
5 | 324231442124234121 |
6 | 5451131015155405 |
7 | 401260555112441 |
oct | 47606056205475 |
9 | 10605753855215 |
10 | 2732416633661 |
11 | 9638a1a57110 |
12 | 381688975b65 |
13 | 16a886957140 |
14 | 9636d14c821 |
15 | 4b122e1d75b |
hex | 27c30b90b3d |
2732416633661 has 16 divisors (see below), whose sum is σ = 3210159035328. Its totient is φ = 2292903331200.
The previous prime is 2732416633613. The next prime is 2732416633673. The reversal of 2732416633661 is 1663366142372.
2732416633661 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 2732416633661 - 222 = 2732412439357 is a prime.
It is a super-2 number, since 2×27324166336612 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2732416633561) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16456346 + ... + 16621556.
It is an arithmetic number, because the mean of its divisors is an integer number (200634939708).
Almost surely, 22732416633661 is an apocalyptic number.
It is an amenable number.
2732416633661 is a deficient number, since it is larger than the sum of its proper divisors (477742401667).
2732416633661 is a wasteful number, since it uses less digits than its factorization.
2732416633661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280892.
The product of its digits is 3919104, while the sum is 50.
The spelling of 2732416633661 in words is "two trillion, seven hundred thirty-two billion, four hundred sixteen million, six hundred thirty-three thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •