Base | Representation |
---|---|
bin | 10100011000000011110… |
… | …011011000110111000001 |
3 | 11221212012221212112210221 |
4 | 110120003303120313001 |
5 | 140420124111010223 |
6 | 2551130441223041 |
7 | 203106556215553 |
oct | 24300363306701 |
9 | 4855187775727 |
10 | 1400223141313 |
11 | 49a9165066a7 |
12 | 1a7457a91a81 |
13 | a206ac04359 |
14 | 4bab20d34d3 |
15 | 26652a3ab5d |
hex | 14603cd8dc1 |
1400223141313 has 8 divisors (see below), whose sum is σ = 1449925442280. Its totient is φ = 1350615423360.
The previous prime is 1400223141311. The next prime is 1400223141377. The reversal of 1400223141313 is 3131413220041.
It can be written as a sum of positive squares in 4 ways, for example, as 41839884304 + 1358383257009 = 204548^2 + 1165497^2 .
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 1400223141313 - 21 = 1400223141311 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1400223141311) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23615620 + ... + 23674837.
It is an arithmetic number, because the mean of its divisors is an integer number (181240680285).
Almost surely, 21400223141313 is an apocalyptic number.
It is an amenable number.
1400223141313 is a deficient number, since it is larger than the sum of its proper divisors (49702300967).
1400223141313 is a wasteful number, since it uses less digits than its factorization.
1400223141313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47291507.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 1400223141313 its reverse (3131413220041), we get a palindrome (4531636361354).
The spelling of 1400223141313 in words is "one trillion, four hundred billion, two hundred twenty-three million, one hundred forty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •