Base | Representation |
---|---|
bin | 10011110011111011111… |
… | …011000100011100011010 |
3 | 11211011002211110101010210 |
4 | 103303323323010130122 |
5 | 134301210133401300 |
6 | 2521233555151550 |
7 | 200234442012651 |
oct | 23637373043432 |
9 | 4734084411123 |
10 | 1361436231450 |
11 | 485422295199 |
12 | 19ba322a55b6 |
13 | 9b4c927a509 |
14 | 49c72aa2198 |
15 | 256327c8050 |
hex | 13cfbec471a |
1361436231450 has 24 divisors (see below), whose sum is σ = 3376361854368. Its totient is φ = 363049661680.
The previous prime is 1361436231409. The next prime is 1361436231457. The reversal of 1361436231450 is 541326341631.
It is a super-2 number, since 2×13614362314502 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1361436231399 and 1361436231408.
It is not an unprimeable number, because it can be changed into a prime (1361436231457) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4538120622 + ... + 4538120921.
It is an arithmetic number, because the mean of its divisors is an integer number (140681743932).
Almost surely, 21361436231450 is an apocalyptic number.
1361436231450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1361436231450 is an abundant number, since it is smaller than the sum of its proper divisors (2014925622918).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1361436231450 is a wasteful number, since it uses less digits than its factorization.
1361436231450 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9076241558 (or 9076241553 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 39.
The spelling of 1361436231450 in words is "one trillion, three hundred sixty-one billion, four hundred thirty-six million, two hundred thirty-one thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •