Base | Representation |
---|---|
bin | 10100011100111010110… |
… | …101101010110010100111 |
3 | 11222100200122001021000102 |
4 | 110130322311222302213 |
5 | 141011321003000343 |
6 | 2553352331534315 |
7 | 203353102146113 |
oct | 24347265526247 |
9 | 4870618037012 |
10 | 1405441453223 |
11 | 4a2054073675 |
12 | 1a84735ba39b |
13 | a26c005c192 |
14 | 4c049182743 |
15 | 2685ac173b8 |
hex | 1473ad6aca7 |
1405441453223 has 4 divisors (see below), whose sum is σ = 1453904951640. Its totient is φ = 1356977954808.
The previous prime is 1405441453211. The next prime is 1405441453249. The reversal of 1405441453223 is 3223541445041.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1405441453223 - 212 = 1405441449127 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 (1405441653223) 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 3 ways as a sum of consecutive naturals, for example, 24231749165 + ... + 24231749222.
It is an arithmetic number, because the mean of its divisors is an integer number (363476237910).
Almost surely, 21405441453223 is an apocalyptic number.
1405441453223 is a deficient number, since it is larger than the sum of its proper divisors (48463498417).
1405441453223 is an equidigital number, since it uses as much as digits as its factorization.
1405441453223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48463498416.
The product of its (nonzero) digits is 230400, while the sum is 38.
Adding to 1405441453223 its reverse (3223541445041), we get a palindrome (4628982898264).
The spelling of 1405441453223 in words is "one trillion, four hundred five billion, four hundred forty-one million, four hundred fifty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •