Base | Representation |
---|---|
bin | 1000001101101110011… |
… | …1000011000110111010 |
3 | 111111021010120112000010 |
4 | 2003123213003012322 |
5 | 4303010042300442 |
6 | 144455312122350 |
7 | 13124112052215 |
oct | 2033347030672 |
9 | 444233515003 |
10 | 141123400122 |
11 | 549395312a1 |
12 | 23425b363b6 |
13 | 104005468b3 |
14 | 6b8a8dc77c |
15 | 3a0e67ab9c |
hex | 20db9c31ba |
141123400122 has 16 divisors (see below), whose sum is σ = 283371292512. Its totient is φ = 46853718000.
The previous prime is 141123400097. The next prime is 141123400129. The reversal of 141123400122 is 221004321141.
141123400122 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-2 number, since 2×1411234001222 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (141123400129) by changing a digit.
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, 46852213 + ... + 46855224.
It is an arithmetic number, because the mean of its divisors is an integer number (17710705782).
Almost surely, 2141123400122 is an apocalyptic number.
141123400122 is an abundant number, since it is smaller than the sum of its proper divisors (142247892390).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141123400122 is a wasteful number, since it uses less digits than its factorization.
141123400122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93707693.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 141123400122 its reverse (221004321141), we get a palindrome (362127721263).
The spelling of 141123400122 in words is "one hundred forty-one billion, one hundred twenty-three million, four hundred thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •