Base | Representation |
---|---|
bin | 11110010001111001100… |
… | …11100011010001100101 |
3 | 10200110110102100111010121 |
4 | 33020330303203101211 |
5 | 114021220432414141 |
6 | 2113542034321541 |
7 | 135111065030056 |
oct | 17107463432145 |
9 | 3613412314117 |
10 | 1040402232421 |
11 | 371260a34122 |
12 | 1497787292b1 |
13 | 77156791846 |
14 | 384da1da72d |
15 | 1c0e37031d1 |
hex | f23cce3465 |
1040402232421 has 4 divisors (see below), whose sum is σ = 1076278171500. Its totient is φ = 1004526293344.
The previous prime is 1040402232413. The next prime is 1040402232451. The reversal of 1040402232421 is 1242322040401.
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 197503803396 + 842898429025 = 444414^2 + 918095^2 .
It is a cyclic number.
It is not a de Polignac number, because 1040402232421 - 23 = 1040402232413 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1040402232451) 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, 17937969496 + ... + 17937969553.
It is an arithmetic number, because the mean of its divisors is an integer number (269069542875).
Almost surely, 21040402232421 is an apocalyptic number.
It is an amenable number.
1040402232421 is a deficient number, since it is larger than the sum of its proper divisors (35875939079).
1040402232421 is an equidigital number, since it uses as much as digits as its factorization.
1040402232421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35875939078.
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 1040402232421 its reverse (1242322040401), we get a palindrome (2282724272822).
The spelling of 1040402232421 in words is "one trillion, forty billion, four hundred two million, two hundred thirty-two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •