Base | Representation |
---|---|
bin | 1001001111000111110010… |
… | …0110110011000101011001 |
3 | 1022221211211211000101212020 |
4 | 2103301330212303011121 |
5 | 2312341221131430431 |
6 | 33333153453205053 |
7 | 2065463053132524 |
oct | 223617446630531 |
9 | 38854754011766 |
10 | 10155393233241 |
11 | 3265972803123 |
12 | 1180224790789 |
13 | 588859b78b49 |
14 | 271748ca3bbb |
15 | 129272252696 |
hex | 93c7c9b3159 |
10155393233241 has 8 divisors (see below), whose sum is σ = 13576825986240. Its totient is φ = 6752111317872.
The previous prime is 10155393233239. The next prime is 10155393233257. The reversal of 10155393233241 is 14233239355101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10155393233241 - 21 = 10155393233239 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10155393233193 and 10155393233202.
It is not an unprimeable number, because it can be changed into a prime (10155393233341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4537708101 + ... + 4537710338.
It is an arithmetic number, because the mean of its divisors is an integer number (1697103248280).
Almost surely, 210155393233241 is an apocalyptic number.
It is an amenable number.
10155393233241 is a deficient number, since it is larger than the sum of its proper divisors (3421432752999).
10155393233241 is an equidigital number, since it uses as much as digits as its factorization.
10155393233241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9075418815.
The product of its (nonzero) digits is 291600, while the sum is 42.
The spelling of 10155393233241 in words is "ten trillion, one hundred fifty-five billion, three hundred ninety-three million, two hundred thirty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •