Base | Representation |
---|---|
bin | 1010010100000000… |
… | …0101000100010001 |
3 | 21010220222020201202 |
4 | 2211000011010101 |
5 | 21132133331033 |
6 | 1134405240545 |
7 | 125412555632 |
oct | 24500050421 |
9 | 7126866652 |
10 | 2768261393 |
11 | 11a067a837 |
12 | 653103155 |
13 | 351696ac1 |
14 | 1c3921889 |
15 | 11306a8e8 |
hex | a5005111 |
2768261393 has 8 divisors (see below), whose sum is σ = 2889926016. Its totient is φ = 2646705600.
The previous prime is 2768261389. The next prime is 2768261399. The reversal of 2768261393 is 3931628672.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2768261393 - 22 = 2768261389 is a prime.
It is a super-2 number, since 2×27682613932 = 15326542279948600898, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2768261399) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27113 + ... + 79193.
It is an arithmetic number, because the mean of its divisors is an integer number (361240752).
Almost surely, 22768261393 is an apocalyptic number.
2768261393 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
2768261393 is a deficient number, since it is larger than the sum of its proper divisors (121664623).
2768261393 is a wasteful number, since it uses less digits than its factorization.
2768261393 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54415.
The product of its digits is 653184, while the sum is 47.
The square root of 2768261393 is about 52614.2698609417. The cubic root of 2768261393 is about 1404.1139862015.
The spelling of 2768261393 in words is "two billion, seven hundred sixty-eight million, two hundred sixty-one thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •