Base | Representation |
---|---|
bin | 100001000110101111001… |
… | …1111000001001010100001 |
3 | 121002222020020002121002111 |
4 | 1002031132133001022201 |
5 | 1044021302110243001 |
6 | 13402115402115321 |
7 | 646503066051052 |
oct | 102153637011241 |
9 | 17088206077074 |
10 | 4549955556001 |
11 | 14a4697326739 |
12 | 61598aaabb41 |
13 | 27009c7249ab |
14 | 11a30d004729 |
15 | 7d54c604851 |
hex | 4235e7c12a1 |
4549955556001 has 8 divisors (see below), whose sum is σ = 4805954557184. Its totient is φ = 4300783194960.
The previous prime is 4549955555963. The next prime is 4549955556043. The reversal of 4549955556001 is 1006555599454.
It is a happy number.
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 4549955556001 - 233 = 4541365621409 is a prime.
It is a super-2 number, since 2×45499555560012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4549955556071) 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 7 ways as a sum of consecutive naturals, for example, 1706658666 + ... + 1706661331.
It is an arithmetic number, because the mean of its divisors is an integer number (600744319648).
Almost surely, 24549955556001 is an apocalyptic number.
It is an amenable number.
4549955556001 is a deficient number, since it is larger than the sum of its proper divisors (255999001183).
4549955556001 is a wasteful number, since it uses less digits than its factorization.
4549955556001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3413320071.
The product of its (nonzero) digits is 24300000, while the sum is 58.
The spelling of 4549955556001 in words is "four trillion, five hundred forty-nine billion, nine hundred fifty-five million, five hundred fifty-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •