Base | Representation |
---|---|
bin | 11111110111001011011100… |
… | …000110100100000001011110 |
3 | 200101011102100221021112101200 |
4 | 133313023130012210001132 |
5 | 121331402343200112410 |
6 | 1214011232321420330 |
7 | 41342103066264402 |
oct | 3767133406440136 |
9 | 611142327245350 |
10 | 140131295707230 |
11 | 407173922363a3 |
12 | 1387247349a6a6 |
13 | 602642ab792a9 |
14 | 26865688bb102 |
15 | 113020ae933c0 |
hex | 7f72dc1a405e |
140131295707230 has 96 divisors (see below), whose sum is σ = 370390611427200. Its totient is φ = 36750843901440.
The previous prime is 140131295707223. The next prime is 140131295707267. The reversal of 140131295707230 is 32707592131041.
140131295707230 is a `hidden beast` number, since 1 + 4 + 0 + 1 + 3 + 1 + 2 + 9 + 570 + 72 + 3 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 28264326 + ... + 32850185.
It is an arithmetic number, because the mean of its divisors is an integer number (3858235535700).
Almost surely, 2140131295707230 is an apocalyptic number.
140131295707230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
140131295707230 is an abundant number, since it is smaller than the sum of its proper divisors (230259315719970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140131295707230 is a wasteful number, since it uses less digits than its factorization.
140131295707230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61114946 (or 61114943 counting only the distinct ones).
The product of its (nonzero) digits is 317520, while the sum is 45.
The spelling of 140131295707230 in words is "one hundred forty trillion, one hundred thirty-one billion, two hundred ninety-five million, seven hundred seven thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •