Base | Representation |
---|---|
bin | 1101100111110100000000… |
… | …11111010011000000010101 |
3 | 10221001200202101222212021020 |
4 | 12303322000133103000111 |
5 | 12411241331422012021 |
6 | 143413131054311353 |
7 | 6211124131350234 |
oct | 663720037230025 |
9 | 127050671885236 |
10 | 29955257610261 |
11 | 95a9a53a97455 |
12 | 34396431b8559 |
13 | 13939cba06719 |
14 | 757bb1018b1b |
15 | 36e311cc47c6 |
hex | 1b3e807d3015 |
29955257610261 has 8 divisors (see below), whose sum is σ = 39940416026400. Its totient is φ = 19970135467152.
The previous prime is 29955257610251. The next prime is 29955257610277. The reversal of 29955257610261 is 16201675255992.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 29955257610261 - 27 = 29955257610133 is a prime.
It is a super-4 number, since 4×299552576102614 (a number of 55 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 29955257610195 and 29955257610204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (29955257610251) 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, 7078986 + ... + 10489163.
It is an arithmetic number, because the mean of its divisors is an integer number (4992552003300).
Almost surely, 229955257610261 is an apocalyptic number.
It is an amenable number.
29955257610261 is a deficient number, since it is larger than the sum of its proper divisors (9985158416139).
29955257610261 is a wasteful number, since it uses less digits than its factorization.
29955257610261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18136515.
The product of its (nonzero) digits is 20412000, while the sum is 60.
The spelling of 29955257610261 in words is "twenty-nine trillion, nine hundred fifty-five billion, two hundred fifty-seven million, six hundred ten thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •