Base | Representation |
---|---|
bin | 10110111000010111101011… |
… | …101110011011100010000101 |
3 | 111012022012112112200000220211 |
4 | 112320113223232123202011 |
5 | 101142213230330021031 |
6 | 554005043030555421 |
7 | 30124221431221054 |
oct | 2670275356334205 |
9 | 435265475600824 |
10 | 100630743595141 |
11 | 2a078293359841 |
12 | b352ab4508b71 |
13 | 441c59122c966 |
14 | 1abc7a818639b |
15 | b9798369abb1 |
hex | 5b85ebb9b885 |
100630743595141 has 2 divisors, whose sum is σ = 100630743595142. Its totient is φ = 100630743595140.
The previous prime is 100630743595093. The next prime is 100630743595237. The reversal of 100630743595141 is 141595347036001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 91726016116900 + 8904727478241 = 9577370^2 + 2984079^2 .
It is a cyclic number.
It is not a de Polignac number, because 100630743595141 - 29 = 100630743594629 is a prime.
It is a super-4 number, since 4×1006307435951414 (a number of 57 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100630743595841) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50315371797570 + 50315371797571.
It is an arithmetic number, because the mean of its divisors is an integer number (50315371797571).
Almost surely, 2100630743595141 is an apocalyptic number.
It is an amenable number.
100630743595141 is a deficient number, since it is larger than the sum of its proper divisors (1).
100630743595141 is an equidigital number, since it uses as much as digits as its factorization.
100630743595141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1360800, while the sum is 49.
The spelling of 100630743595141 in words is "one hundred trillion, six hundred thirty billion, seven hundred forty-three million, five hundred ninety-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •