Base | Representation |
---|---|
bin | 10100011000110010000… |
… | …111010010100100111101 |
3 | 11221221020002212200000200 |
4 | 110120302013102210331 |
5 | 140423222012013042 |
6 | 2551335514314113 |
7 | 203135042310546 |
oct | 24306207224475 |
9 | 4857202780020 |
10 | 1401000110397 |
11 | 4a0185047008 |
12 | 1a7634128939 |
13 | a2162b82384 |
14 | 4bb473854cd |
15 | 2669ad63c4c |
hex | 146321d293d |
1401000110397 has 48 divisors (see below), whose sum is σ = 2063722639680. Its totient is φ = 915605438976.
The previous prime is 1401000110387. The next prime is 1401000110401. The reversal of 1401000110397 is 7930110001041.
It is not a de Polignac number, because 1401000110397 - 211 = 1401000108349 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1401000110397.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1401000110327) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 323032213 + ... + 323036549.
It is an arithmetic number, because the mean of its divisors is an integer number (42994221660).
Almost surely, 21401000110397 is an apocalyptic number.
It is an amenable number.
1401000110397 is a deficient number, since it is larger than the sum of its proper divisors (662722529283).
1401000110397 is a wasteful number, since it uses less digits than its factorization.
1401000110397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5962 (or 5959 counting only the distinct ones).
The product of its (nonzero) digits is 756, while the sum is 27.
The spelling of 1401000110397 in words is "one trillion, four hundred one billion, one hundred ten thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •