Base | Representation |
---|---|
bin | 10101001001011010010… |
… | …011110111101100000101 |
3 | 12010220222222201101100122 |
4 | 111021122103313230011 |
5 | 142302140302314300 |
6 | 3031333005351325 |
7 | 206664000035234 |
oct | 25113223675405 |
9 | 5126888641318 |
10 | 1453214104325 |
11 | 510339527505 |
12 | 1b5786568545 |
13 | a7064513179 |
14 | 5049bb56b1b |
15 | 27c04c8bc85 |
hex | 1525a4f7b05 |
1453214104325 has 12 divisors (see below), whose sum is σ = 1826670224388. Its totient is φ = 1146645648000.
The previous prime is 1453214104313. The next prime is 1453214104343. The reversal of 1453214104325 is 5234014123541.
It can be written as a sum of positive squares in 6 ways, for example, as 80827627204 + 1372386477121 = 284302^2 + 1171489^2 .
It is not a de Polignac number, because 1453214104325 - 212 = 1453214100229 is a prime.
It is a super-2 number, since 2×14532141043252 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 398139026 + ... + 398142675.
It is an arithmetic number, because the mean of its divisors is an integer number (152222518699).
Almost surely, 21453214104325 is an apocalyptic number.
It is an amenable number.
1453214104325 is a deficient number, since it is larger than the sum of its proper divisors (373456120063).
1453214104325 is an equidigital number, since it uses as much as digits as its factorization.
1453214104325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 796281784 (or 796281779 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 35.
Adding to 1453214104325 its reverse (5234014123541), we get a palindrome (6687228227866).
The spelling of 1453214104325 in words is "one trillion, four hundred fifty-three billion, two hundred fourteen million, one hundred four thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •