Base | Representation |
---|---|
bin | 10100011000010001000… |
… | …010100110101111001001 |
3 | 11221212210102210000212111 |
4 | 110120101002212233021 |
5 | 140421102434442441 |
6 | 2551204453342321 |
7 | 203115224036503 |
oct | 24302102465711 |
9 | 4855712700774 |
10 | 1400445234121 |
11 | 49aa1a90927a |
12 | 1a74ba3379a1 |
13 | a20a4c2550b |
14 | 4bad37c6d73 |
15 | 266672ab081 |
hex | 146110a6bc9 |
1400445234121 has 8 divisors (see below), whose sum is σ = 1402028839424. Its totient is φ = 1398862427040.
The previous prime is 1400445234109. The next prime is 1400445234151. The reversal of 1400445234121 is 1214325440041.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1400445234121 - 223 = 1400436845513 is a prime.
It is a super-2 number, since 2×14004452341212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1400445234151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3346861 + ... + 3741973.
It is an arithmetic number, because the mean of its divisors is an integer number (175253604928).
Almost surely, 21400445234121 is an apocalyptic number.
It is an amenable number.
1400445234121 is a deficient number, since it is larger than the sum of its proper divisors (1583605303).
1400445234121 is a wasteful number, since it uses less digits than its factorization.
1400445234121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 399111.
The product of its (nonzero) digits is 15360, while the sum is 31.
The spelling of 1400445234121 in words is "one trillion, four hundred billion, four hundred forty-five million, two hundred thirty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •