Base | Representation |
---|---|
bin | 11111000000000110111… |
… | …111010010010111010001 |
3 | 21112122222201000202110112 |
4 | 133000012333102113101 |
5 | 234401100241014101 |
6 | 4310411340211105 |
7 | 306626550663104 |
oct | 37000677222721 |
9 | 7478881022415 |
10 | 2130421032401 |
11 | 751563150882 |
12 | 2a4a81839a95 |
13 | 125b897327ac |
14 | 75181c3673b |
15 | 3a63ccab6bb |
hex | 1f006fd25d1 |
2130421032401 has 4 divisors (see below), whose sum is σ = 2131311306852. Its totient is φ = 2129530757952.
The previous prime is 2130421032373. The next prime is 2130421032427. The reversal of 2130421032401 is 1042301240312.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 234402190801 + 1896018841600 = 484151^2 + 1376960^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2130421032401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2130421032491) 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, 445133636 + ... + 445138421.
It is an arithmetic number, because the mean of its divisors is an integer number (532827826713).
Almost surely, 22130421032401 is an apocalyptic number.
It is an amenable number.
2130421032401 is a deficient number, since it is larger than the sum of its proper divisors (890274451).
2130421032401 is an equidigital number, since it uses as much as digits as its factorization.
2130421032401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 890274450.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 2130421032401 its reverse (1042301240312), we get a palindrome (3172722272713).
The spelling of 2130421032401 in words is "two trillion, one hundred thirty billion, four hundred twenty-one million, thirty-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •