Base | Representation |
---|---|
bin | 1001011000011011100111… |
… | …0101001110011101110110 |
3 | 1100112010200101012010210110 |
4 | 2112012321311032131312 |
5 | 2323001301024344132 |
6 | 33534444335403450 |
7 | 2113154412062466 |
oct | 226067165163566 |
9 | 40463611163713 |
10 | 10315334215542 |
11 | 3317788276424 |
12 | 11a7220683586 |
13 | 59a968b20945 |
14 | 27939ca13ba6 |
15 | 12d4d39331cc |
hex | 961b9d4e776 |
10315334215542 has 64 divisors (see below), whose sum is σ = 21017478924288. Its totient is φ = 3374434560000.
The previous prime is 10315334215531. The next prime is 10315334215547. The reversal of 10315334215542 is 24551243351301.
It is a super-2 number, since 2×103153342155422 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10315334215542.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10315334215547) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 241346398 + ... + 241389134.
It is an arithmetic number, because the mean of its divisors is an integer number (328398108192).
Almost surely, 210315334215542 is an apocalyptic number.
10315334215542 is an abundant number, since it is smaller than the sum of its proper divisors (10702144708746).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10315334215542 is a wasteful number, since it uses less digits than its factorization.
10315334215542 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45405.
The product of its (nonzero) digits is 216000, while the sum is 39.
Adding to 10315334215542 its reverse (24551243351301), we get a palindrome (34866577566843).
The spelling of 10315334215542 in words is "ten trillion, three hundred fifteen billion, three hundred thirty-four million, two hundred fifteen thousand, five hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •