Base | Representation |
---|---|
bin | 1001111101011000000011… |
… | …0110110100011011000011 |
3 | 1102202210221122212001121002 |
4 | 2133112000312310123003 |
5 | 2413401132033213101 |
6 | 35142213111522215 |
7 | 2210054015651012 |
oct | 237260066643303 |
9 | 42683848761532 |
10 | 10950033491651 |
11 | 3541979491711 |
12 | 128a23408936b |
13 | 6157785ac697 |
14 | 29bdad482a79 |
15 | 13ec7ec2cd6b |
hex | 9f580db46c3 |
10950033491651 has 8 divisors (see below), whose sum is σ = 11033862073344. Its totient is φ = 10866208554760.
The previous prime is 10950033491647. The next prime is 10950033491653. The reversal of 10950033491651 is 15619433005901.
10950033491651 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10950033491651 - 22 = 10950033491647 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10950033491596 and 10950033491605.
It is not an unprimeable number, because it can be changed into a prime (10950033491653) 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, 5280806 + ... + 7055988.
It is an arithmetic number, because the mean of its divisors is an integer number (1379232759168).
Almost surely, 210950033491651 is an apocalyptic number.
10950033491651 is a deficient number, since it is larger than the sum of its proper divisors (83828581693).
10950033491651 is a wasteful number, since it uses less digits than its factorization.
10950033491651 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1822401.
The product of its (nonzero) digits is 437400, while the sum is 47.
The spelling of 10950033491651 in words is "ten trillion, nine hundred fifty billion, thirty-three million, four hundred ninety-one thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •