Base | Representation |
---|---|
bin | 1001001110101100101100… |
… | …1010010111001011111101 |
3 | 1022221011002000111002112200 |
4 | 2103223023022113023331 |
5 | 2312231323014310123 |
6 | 33325552121222113 |
7 | 2065114622220105 |
oct | 223531312271375 |
9 | 38834060432480 |
10 | 10148121244413 |
11 | 32628809772a9 |
12 | 117a935331939 |
13 | 587c6b401a89 |
14 | 271259186205 |
15 | 128e98b0e143 |
hex | 93acb2972fd |
10148121244413 has 6 divisors (see below), whose sum is σ = 14658397353054. Its totient is φ = 6765414162936.
The previous prime is 10148121244403. The next prime is 10148121244427. The reversal of 10148121244413 is 31444212184101.
10148121244413 is a `hidden beast` number, since 1 + 0 + 1 + 481 + 2 + 124 + 44 + 13 = 666.
It can be written as a sum of positive squares in only one way, i.e., 9441442272249 + 706678972164 = 3072693^2 + 840642^2 .
It is not a de Polignac number, because 10148121244413 - 29 = 10148121243901 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10148121244403) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 563784513570 + ... + 563784513587.
It is an arithmetic number, because the mean of its divisors is an integer number (2443066225509).
Almost surely, 210148121244413 is an apocalyptic number.
It is an amenable number.
10148121244413 is a deficient number, since it is larger than the sum of its proper divisors (4510276108641).
10148121244413 is a wasteful number, since it uses less digits than its factorization.
10148121244413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1127569027163 (or 1127569027160 counting only the distinct ones).
The product of its (nonzero) digits is 24576, while the sum is 36.
The spelling of 10148121244413 in words is "ten trillion, one hundred forty-eight billion, one hundred twenty-one million, two hundred forty-four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •