Base | Representation |
---|---|
bin | 11011010000111011… |
… | …010111010100110100 |
3 | 2210120020010110000122 |
4 | 123100323113110310 |
5 | 434423401323430 |
6 | 21240533231112 |
7 | 2054314423121 |
oct | 332073272464 |
9 | 83506113018 |
10 | 29275026740 |
11 | 11462a97983 |
12 | 5810192498 |
13 | 29b7120a3b |
14 | 15ba04d748 |
15 | b65171ee5 |
hex | 6d0ed7534 |
29275026740 has 24 divisors (see below), whose sum is σ = 61732659912. Its totient is φ = 11661419520.
The previous prime is 29275026719. The next prime is 29275026751. The reversal of 29275026740 is 4762057292.
It can be written as a sum of positive squares in 4 ways, for example, as 8940837136 + 20334189604 = 94556^2 + 142598^2 .
It is a junction number, because it is equal to n+sod(n) for n = 29275026691 and 29275026700.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3032009 + ... + 3041648.
It is an arithmetic number, because the mean of its divisors is an integer number (2572194163).
Almost surely, 229275026740 is an apocalyptic number.
29275026740 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
29275026740 is an abundant number, since it is smaller than the sum of its proper divisors (32457633172).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
29275026740 is a wasteful number, since it uses less digits than its factorization.
29275026740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6073907 (or 6073905 counting only the distinct ones).
The product of its (nonzero) digits is 423360, while the sum is 44.
The spelling of 29275026740 in words is "twenty-nine billion, two hundred seventy-five million, twenty-six thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •