Base | Representation |
---|---|
bin | 111011101100011001101… |
… | …011100111010010100001 |
3 | 112112011022010012111021100 |
4 | 323230121223213102201 |
5 | 1014202122401144301 |
6 | 12420253503145013 |
7 | 602240321023512 |
oct | 73543153472241 |
9 | 15464263174240 |
10 | 4102124631201 |
11 | 1341779459623 |
12 | 5630292a5169 |
13 | 239aa083b3ac |
14 | 10278861ca09 |
15 | 71a8b9c5286 |
hex | 3bb19ae74a1 |
4102124631201 has 24 divisors (see below), whose sum is σ = 6247561320000. Its totient is φ = 2586490257312.
The previous prime is 4102124631169. The next prime is 4102124631211. The reversal of 4102124631201 is 1021364212014.
4102124631201 is a `hidden beast` number, since 4 + 1 + 0 + 2 + 1 + 2 + 4 + 631 + 20 + 1 = 666.
It is not a de Polignac number, because 4102124631201 - 25 = 4102124631169 is a prime.
It is not an unprimeable number, because it can be changed into a prime (4102124631211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 19921806 + ... + 20126663.
It is an arithmetic number, because the mean of its divisors is an integer number (260315055000).
Almost surely, 24102124631201 is an apocalyptic number.
It is an amenable number.
4102124631201 is a deficient number, since it is larger than the sum of its proper divisors (2145436688799).
4102124631201 is a wasteful number, since it uses less digits than its factorization.
4102124631201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40049093 (or 40049090 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
Adding to 4102124631201 its reverse (1021364212014), we get a palindrome (5123488843215).
The spelling of 4102124631201 in words is "four trillion, one hundred two billion, one hundred twenty-four million, six hundred thirty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •