Base | Representation |
---|---|
bin | 111011101100100000000… |
… | …101010011111111100001 |
3 | 112112011120121021222101010 |
4 | 323230200011103333201 |
5 | 1014202332344444301 |
6 | 12420312301131133 |
7 | 602243063636163 |
oct | 73544005237741 |
9 | 15464517258333 |
10 | 4102232031201 |
11 | 1341824044857 |
12 | 563059259aa9 |
13 | 239ab9b731a5 |
14 | 1027989b8933 |
15 | 71a9613c5d6 |
hex | 3bb20153fe1 |
4102232031201 has 4 divisors (see below), whose sum is σ = 5469642708272. Its totient is φ = 2734821354132.
The previous prime is 4102232031127. The next prime is 4102232031217. The reversal of 4102232031201 is 1021302322014.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 4102232031201 - 225 = 4102198476769 is a prime.
It is a super-2 number, since 2×41022320312012 (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 (4102232031221) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 683705338531 + ... + 683705338536.
It is an arithmetic number, because the mean of its divisors is an integer number (1367410677068).
Almost surely, 24102232031201 is an apocalyptic number.
It is an amenable number.
4102232031201 is a deficient number, since it is larger than the sum of its proper divisors (1367410677071).
4102232031201 is a wasteful number, since it uses less digits than its factorization.
4102232031201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1367410677070.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 4102232031201 its reverse (1021302322014), we get a palindrome (5123534353215).
The spelling of 4102232031201 in words is "four trillion, one hundred two billion, two hundred thirty-two million, thirty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •