Base | Representation |
---|---|
bin | 1000001101101000110… |
… | …1110101011011000111 |
3 | 111111012111120100020212 |
4 | 2003122031311123013 |
5 | 4302433100411010 |
6 | 144453114550035 |
7 | 13123406216015 |
oct | 2033215653307 |
9 | 444174510225 |
10 | 141100013255 |
11 | 54927308403 |
12 | 2341a13831b |
13 | 103c8748a06 |
14 | 6b877718b5 |
15 | 3a0c5ab505 |
hex | 20da3756c7 |
141100013255 has 8 divisors (see below), whose sum is σ = 176681755872. Its totient is φ = 107972183968.
The previous prime is 141100013207. The next prime is 141100013281. The reversal of 141100013255 is 552310001141.
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 141100013255 - 232 = 136805045959 is a prime.
It is a super-2 number, since 2×1411000132552 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 141100013255.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 613478204 + ... + 613478433.
It is an arithmetic number, because the mean of its divisors is an integer number (22085219484).
Almost surely, 2141100013255 is an apocalyptic number.
141100013255 is a deficient number, since it is larger than the sum of its proper divisors (35581742617).
141100013255 is a wasteful number, since it uses less digits than its factorization.
141100013255 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1226956665.
The product of its (nonzero) digits is 600, while the sum is 23.
Adding to 141100013255 its reverse (552310001141), we get a palindrome (693410014396).
The spelling of 141100013255 in words is "one hundred forty-one billion, one hundred million, thirteen thousand, two hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •