Base | Representation |
---|---|
bin | 10101001000010010101… |
… | …100010100110001001101 |
3 | 12010210220020210101000102 |
4 | 111020102230110301031 |
5 | 142242210203232331 |
6 | 3031013444140445 |
7 | 206622140036045 |
oct | 25102254246115 |
9 | 5123806711012 |
10 | 1452012555341 |
11 | 50a882262a17 |
12 | 1b54b0097725 |
13 | a6c025c893a |
14 | 503c6342725 |
15 | 27b845474cb |
hex | 15212b14c4d |
1452012555341 has 16 divisors (see below), whose sum is σ = 1598865402240. Its totient is φ = 1312501132800.
The previous prime is 1452012555251. The next prime is 1452012555391. The reversal of 1452012555341 is 1435552102541.
It is a cyclic number.
It is not a de Polignac number, because 1452012555341 - 214 = 1452012538957 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1452012555295 and 1452012555304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1452012555391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3967760 + ... + 4318233.
It is an arithmetic number, because the mean of its divisors is an integer number (99929087640).
Almost surely, 21452012555341 is an apocalyptic number.
It is an amenable number.
1452012555341 is a deficient number, since it is larger than the sum of its proper divisors (146852846899).
1452012555341 is a wasteful number, since it uses less digits than its factorization.
1452012555341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8286436.
The product of its (nonzero) digits is 120000, while the sum is 38.
Adding to 1452012555341 its reverse (1435552102541), we get a palindrome (2887564657882).
The spelling of 1452012555341 in words is "one trillion, four hundred fifty-two billion, twelve million, five hundred fifty-five thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •