Base | Representation |
---|---|
bin | 10001100010010101110… |
… | …011100000100000001100 |
3 | 11021012120210001211020001 |
4 | 101202111303200200030 |
5 | 124221023130304130 |
6 | 2321341152134044 |
7 | 153031414160263 |
oct | 21422563404014 |
9 | 4235523054201 |
10 | 1205104150540 |
11 | 42509996aa24 |
12 | 175682b37324 |
13 | 89843bb1324 |
14 | 4248237b5da |
15 | 21532d666ca |
hex | 11895ce080c |
1205104150540 has 12 divisors (see below), whose sum is σ = 2530718716176. Its totient is φ = 482041660208.
The previous prime is 1205104150487. The next prime is 1205104150553. The reversal of 1205104150540 is 450514015021.
It is a super-3 number, since 3×12051041505403 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1205104150499 and 1205104150508.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30127603744 + ... + 30127603783.
It is an arithmetic number, because the mean of its divisors is an integer number (210893226348).
Almost surely, 21205104150540 is an apocalyptic number.
1205104150540 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1205104150540 is an abundant number, since it is smaller than the sum of its proper divisors (1325614565636).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1205104150540 is a wasteful number, since it uses less digits than its factorization.
1205104150540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60255207536 (or 60255207534 counting only the distinct ones).
The product of its (nonzero) digits is 4000, while the sum is 28.
Adding to 1205104150540 its reverse (450514015021), we get a palindrome (1655618165561).
The spelling of 1205104150540 in words is "one trillion, two hundred five billion, one hundred four million, one hundred fifty thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •