Base | Representation |
---|---|
bin | 100000000110110011101101… |
… | …000000000101000110111010 |
3 | 200111222002121121102201021112 |
4 | 200012303231000011012322 |
5 | 122002001444141410120 |
6 | 1220152455020040322 |
7 | 41512514330105120 |
oct | 4006635500050672 |
9 | 614862547381245 |
10 | 141205321044410 |
11 | 40aa09275727a7 |
12 | 13a066543930a2 |
13 | 60a37b251269c |
14 | 26c25343a7910 |
15 | 114d11b3e7bc5 |
hex | 806ced0051ba |
141205321044410 has 16 divisors (see below), whose sum is σ = 290479517577216. Its totient is φ = 48413252929488.
The previous prime is 141205321044379. The next prime is 141205321044449. The reversal of 141205321044410 is 14440123502141.
It is a super-2 number, since 2×1412053210444102 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 1008609435962 + ... + 1008609436101.
It is an arithmetic number, because the mean of its divisors is an integer number (18154969848576).
Almost surely, 2141205321044410 is an apocalyptic number.
141205321044410 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
141205321044410 is an abundant number, since it is smaller than the sum of its proper divisors (149274196532806).
141205321044410 is a wasteful number, since it uses less digits than its factorization.
141205321044410 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2017218872077.
The product of its (nonzero) digits is 15360, while the sum is 32.
Adding to 141205321044410 its reverse (14440123502141), we get a palindrome (155645444546551).
The spelling of 141205321044410 in words is "one hundred forty-one trillion, two hundred five billion, three hundred twenty-one million, forty-four thousand, four hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •