Base | Representation |
---|---|
bin | 11111111000010111110110… |
… | …011000100011100001010001 |
3 | 200101110021010210222202100010 |
4 | 133320113312120203201101 |
5 | 121334223410244310001 |
6 | 1214113041501145133 |
7 | 41351036204663010 |
oct | 3770276630434121 |
9 | 611407123882303 |
10 | 140213341010001 |
11 | 40749164711746 |
12 | 1388635025b1a9 |
13 | 60310a495a81c |
14 | 268a50d144a77 |
15 | 113240dcc28d6 |
hex | 7f85f6623851 |
140213341010001 has 16 divisors (see below), whose sum is σ = 213882620045184. Its totient is φ = 80037835780224.
The previous prime is 140213341009997. The next prime is 140213341010003. The reversal of 140213341010001 is 100010143312041.
It is not a de Polignac number, because 140213341010001 - 22 = 140213341009997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 140213341010001.
It is not an unprimeable number, because it can be changed into a prime (140213341010003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3503036526 + ... + 3503076551.
It is an arithmetic number, because the mean of its divisors is an integer number (13367663752824).
Almost surely, 2140213341010001 is an apocalyptic number.
It is an amenable number.
140213341010001 is a deficient number, since it is larger than the sum of its proper divisors (73669279035183).
140213341010001 is an equidigital number, since it uses as much as digits as its factorization.
140213341010001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7006114040.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 140213341010001 its reverse (100010143312041), we get a palindrome (240223484322042).
The spelling of 140213341010001 in words is "one hundred forty trillion, two hundred thirteen billion, three hundred forty-one million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •