Base | Representation |
---|---|
bin | 1000001110000110001… |
… | …1111010011011101010 |
3 | 111111112002102222120002 |
4 | 2003201203322123222 |
5 | 4303211122211300 |
6 | 144513240103002 |
7 | 13126433513624 |
oct | 2034143723352 |
9 | 444462388502 |
10 | 141223241450 |
11 | 5498a924595 |
12 | 23453464a62 |
13 | 104181330c5 |
14 | 6b99c8bc14 |
15 | 3a182ed5d5 |
hex | 20e18fa6ea |
141223241450 has 24 divisors (see below), whose sum is σ = 262707328512. Its totient is φ = 56482393520.
The previous prime is 141223241437. The next prime is 141223241479. The reversal of 141223241450 is 54142322141.
It is a happy number.
141223241450 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×1412232414503 (a number of 34 digits) contains 333 as substring.
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 11 ways as a sum of consecutive naturals, for example, 250967 + ... + 587733.
It is an arithmetic number, because the mean of its divisors is an integer number (10946138688).
Almost surely, 2141223241450 is an apocalyptic number.
141223241450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
141223241450 is a deficient number, since it is larger than the sum of its proper divisors (121484087062).
141223241450 is a wasteful number, since it uses less digits than its factorization.
141223241450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 345166 (or 345161 counting only the distinct ones).
The product of its (nonzero) digits is 7680, while the sum is 29.
Adding to 141223241450 its reverse (54142322141), we get a palindrome (195365563591).
The spelling of 141223241450 in words is "one hundred forty-one billion, two hundred twenty-three million, two hundred forty-one thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •