Base | Representation |
---|---|
bin | 1011000010010111010100… |
… | …0000010011100001101011 |
3 | 1120222010012010120201202101 |
4 | 2300211311000103201223 |
5 | 3042310440340003301 |
6 | 41450504353114231 |
7 | 2361512461606354 |
oct | 260456500234153 |
9 | 46863163521671 |
10 | 12135245625451 |
11 | 395958a876a83 |
12 | 143ba85258977 |
13 | 6a046c2934b0 |
14 | 2dd4c5a06d2b |
15 | 1609eb558701 |
hex | b097501386b |
12135245625451 has 4 divisors (see below), whose sum is σ = 13068726058192. Its totient is φ = 11201765192712.
The previous prime is 12135245625443. The next prime is 12135245625563. The reversal of 12135245625451 is 15452654253121.
It is a happy number.
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 12135245625451 - 23 = 12135245625443 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12135245625431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 466740216351 + ... + 466740216376.
It is an arithmetic number, because the mean of its divisors is an integer number (3267181514548).
Almost surely, 212135245625451 is an apocalyptic number.
12135245625451 is a deficient number, since it is larger than the sum of its proper divisors (933480432741).
12135245625451 is an equidigital number, since it uses as much as digits as its factorization.
12135245625451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 933480432740.
The product of its digits is 1440000, while the sum is 46.
Adding to 12135245625451 its reverse (15452654253121), we get a palindrome (27587899878572).
The spelling of 12135245625451 in words is "twelve trillion, one hundred thirty-five billion, two hundred forty-five million, six hundred twenty-five thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •