Base | Representation |
---|---|
bin | 10110110101110010100100… |
… | …100010101000111000110001 |
3 | 111011200020221001010220212121 |
4 | 112311302210202220320301 |
5 | 101131312134122201031 |
6 | 553351402551154241 |
7 | 30105344163524224 |
oct | 2665624442507061 |
9 | 434606831126777 |
10 | 100453455662641 |
11 | 2a00a0869a6064 |
12 | b324677075981 |
13 | 44089494387a3 |
14 | 1ab3d8a6415bb |
15 | b9305910d011 |
hex | 5b5ca48a8e31 |
100453455662641 has 8 divisors (see below), whose sum is σ = 104026410314280. Its totient is φ = 96887770503552.
The previous prime is 100453455662533. The next prime is 100453455662647. The reversal of 100453455662641 is 146266554354001.
It can be written as a sum of positive squares in 4 ways, for example, as 13684975861041 + 86768479801600 = 3699321^2 + 9314960^2 .
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 100453455662641 - 29 = 100453455662129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100453455662647) 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, 1817345010 + ... + 1817400283.
It is an arithmetic number, because the mean of its divisors is an integer number (13003301289285).
Almost surely, 2100453455662641 is an apocalyptic number.
It is an amenable number.
100453455662641 is a deficient number, since it is larger than the sum of its proper divisors (3572954651639).
100453455662641 is an equidigital number, since it uses as much as digits as its factorization.
100453455662641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3634746275.
The product of its (nonzero) digits is 10368000, while the sum is 52.
The spelling of 100453455662641 in words is "one hundred trillion, four hundred fifty-three billion, four hundred fifty-five million, six hundred sixty-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •