Base | Representation |
---|---|
bin | 10110110001010011101111… |
… | …010010010111100111010101 |
3 | 111010120210222010122000111211 |
4 | 112301103233102113213111 |
5 | 101111240411320342402 |
6 | 552554110021301421 |
7 | 30044162104125130 |
oct | 2661235722274725 |
9 | 433523863560454 |
10 | 100145472043477 |
11 | 29a005021aa5a3 |
12 | b294a43b64871 |
13 | 43b58a65b0a93 |
14 | 1aa30d109b217 |
15 | b8a030adc4d7 |
hex | 5b14ef4979d5 |
100145472043477 has 8 divisors (see below), whose sum is σ = 115464817325376. Its totient is φ = 85079339080512.
The previous prime is 100145472043469. The next prime is 100145472043517. The reversal of 100145472043477 is 774340274541001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100145472043477 - 23 = 100145472043469 is a prime.
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 100145472043477.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100145472043427) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 63303078883 + ... + 63303080464.
It is an arithmetic number, because the mean of its divisors is an integer number (14433102165672).
Almost surely, 2100145472043477 is an apocalyptic number.
It is an amenable number.
100145472043477 is a deficient number, since it is larger than the sum of its proper divisors (15319345281899).
100145472043477 is a wasteful number, since it uses less digits than its factorization.
100145472043477 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126606159467.
The product of its (nonzero) digits is 2634240, while the sum is 49.
The spelling of 100145472043477 in words is "one hundred trillion, one hundred forty-five billion, four hundred seventy-two million, forty-three thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •