Base | Representation |
---|---|
bin | 1011000000101000010100… |
… | …1010110010111101001111 |
3 | 1120212021021202200202221010 |
4 | 2300022011022302331033 |
5 | 3041313431210240030 |
6 | 41425100133140303 |
7 | 2356406246402265 |
oct | 260120512627517 |
9 | 46767252622833 |
10 | 12105452040015 |
11 | 39479910a72a4 |
12 | 143614b48a693 |
13 | 69a7018c02b9 |
14 | 2dbc9ab70435 |
15 | 15ed55b046b0 |
hex | b02852b2f4f |
12105452040015 has 8 divisors (see below), whose sum is σ = 19368723264048. Its totient is φ = 6456241088000.
The previous prime is 12105452039929. The next prime is 12105452040203. The reversal of 12105452040015 is 51004025450121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12105452040015 - 210 = 12105452038991 is a prime.
It is a super-2 number, since 2×121054520400152 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 403515067986 + ... + 403515068015.
It is an arithmetic number, because the mean of its divisors is an integer number (2421090408006).
Almost surely, 212105452040015 is an apocalyptic number.
12105452040015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
12105452040015 is a deficient number, since it is larger than the sum of its proper divisors (7263271224033).
12105452040015 is an equidigital number, since it uses as much as digits as its factorization.
12105452040015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 807030136009.
The product of its (nonzero) digits is 8000, while the sum is 30.
Adding to 12105452040015 its reverse (51004025450121), we get a palindrome (63109477490136).
The spelling of 12105452040015 in words is "twelve trillion, one hundred five billion, four hundred fifty-two million, forty thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •