Base | Representation |
---|---|
bin | 1010001001001111… |
… | …0100110101010100 |
3 | 21000210000010100200 |
4 | 2202103310311110 |
5 | 21034103344012 |
6 | 1130113340500 |
7 | 124324006635 |
oct | 24223646524 |
9 | 7023003320 |
10 | 2723106132 |
11 | 1178138a3a |
12 | 63bb67730 |
13 | 345216906 |
14 | 1bb92988c |
15 | 10e0eb3dc |
hex | a24f4d54 |
2723106132 has 18 divisors (see below), whose sum is σ = 6883407258. Its totient is φ = 907702032.
The previous prime is 2723106109. The next prime is 2723106151. The reversal of 2723106132 is 2316013272.
2723106132 is a `hidden beast` number, since 27 + 23 + 1 + 0 + 613 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 2312071056 + 411035076 = 48084^2 + 20274^2 .
It is a tau number, because it is divible by the number of its divisors (18).
It is a super-2 number, since 2×27231061322 = 14830614012272002848, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2723106096 and 2723106105.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 37820883 + ... + 37820954.
Almost surely, 22723106132 is an apocalyptic number.
It is an amenable number.
2723106132 is an abundant number, since it is smaller than the sum of its proper divisors (4160301126).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2723106132 is a wasteful number, since it uses less digits than its factorization.
2723106132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75641847 (or 75641842 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 27.
The square root of 2723106132 is about 52183.3894261383. The cubic root of 2723106132 is about 1396.4375638119.
The spelling of 2723106132 in words is "two billion, seven hundred twenty-three million, one hundred six thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •